Distributed Largest-First Algorithm for Graph Coloring
In the paper we present a distributed probabilistic algorithm for coloring the vertices of a graph. Since this algorithm resembles a largest-first strategy, we call it the distributed LF (DLF) algorithm. The coloring obtained by DLF is optimal or near optimal for numerous classes of graphs e.g. complete k-partite, caterpillars, crowns, bipartite wheels. We also show that DLF runs in O(Δ2 log n) rounds for an arbitrary graph, where n is the number of vertices and Δ denotes the largest vertex degree.
Unable to display preview. Download preview PDF.
- 5.Kubale, M.: Introduction to Computational Complexity and Algorithmic Graph Coloring. GTN, Gdańsk (1998)Google Scholar
- 6.Kubale, M., Kuszner, Ł.: A better practical algorithm for distributed graph coloring. In: Proc. of IEEE International Conference on Parallel Computing in Electrical Engineering, pp. 72–75 (2002)Google Scholar