Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence

We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known deterministic algorithms for (2 - 1)-edge-coloring requires O() + log n time [23], where is the maximum degree of the input graph. Also, recent results of [5] for vertex-coloring imply that one can get an O()-edge-coloring in O(

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Leonid Barenboim, Michael Elkin
• Keywords: Algorithms, CORR 2010, Deterministic Algorithm, Education, Maximum Degree