An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms

Author： Finocchi Irene   Panconesi Alessandro   Silvestri Riccardo  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.41, Iss.1, 2004-10, pp. : 1-23

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Combinatorial algorithms for distributed graph coloring

By Barenboim Leonid   Elkin Michael  

Distributed Computing, Vol. 27, Iss. 2, 2014-04 ,pp. : 79-93

Springer Publishing Company

Access to resources Recommend Favorite

Parallel I/O scheduling using randomized, distributed edge coloring algorithms

By Durand D.   Jain R.   Tseytlin D.  

Journal of Parallel and Distributed Computing, Vol. 63, Iss. 6, 2003-06 ,pp. : 611-618

Elsevier

Access to resources Recommend Favorite

A NEW APPROACH TO THE VERTEX COLORING PROBLEM

By Torkestani Javad Akbari  

Cybernetics and Systems, Vol. 44, Iss. 5, 2013-07 ,pp. : 444-466

Taylor & Francis Ltd

Access to resources Recommend Favorite

Distributed Algorithms

By Mavronicolas M.  

Theoretical Computer Science, Vol. 220, Iss. 1, 1999-06 ,pp. : 1-1

Elsevier

Access to resources Recommend Favorite

Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems

By Liang W.   Shen X.   Hu Q.  

Journal of Parallel and Distributed Computing, Vol. 32, Iss. 1, 1996-01 ,pp. : 66-73

Academic Press

Access to resources Recommend Favorite