loading...
A Better Practical Algorithm for Distributed Graph Coloring
Warsaw, Poland September 22-September 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCEE.2002.1115204International Conference on Parallel ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Marek Kubale, Gdańsk University of Technology
łukasz Kuszner, Gdańsk University of Technology
In the paper we present a new distributed algorithm for coloring the vertices of a graph. A practical simulation shows that this algorithmperforms much better then a naive distributed algorithm.
Citation:
Marek Kubale, łukasz Kuszner, "A Better Practical Algorithm for Distributed Graph Coloring," parelec, pp.72, International Conference on Parallel Computing in Electrical Engineering (PARELEC'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.