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.

[1]  Richard M. Karp,et al.  Probabilistic recurrence relations , 1994, JACM.

[2]  Marek Kubale,et al.  A better practical algorithm for distributed graph coloring , 2002, Proceedings. International Conference on Parallel Computing in Electrical Engineering.

[3]  Roberto Battiti,et al.  Assigning codes in wireless networks: bounds and scaling properties , 1999, Wirel. Networks.

[4]  Alessandro Panconesi,et al.  Fast distributed algorithms for Brooks-Vizing colourings , 2000, SODA '98.

[5]  Roberto Battiti,et al.  Assigning Codes in Wireless Networks , 1999 .

[6]  Öjvind Johansson Simple Distributed Delta+1-coloring of Graphs , 1999, Inf. Process. Lett..