An experimental study of a simple, distributed edge coloring algorithm

We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysis, it computes nearly optimal colorings very quickly [12]. We test the algorithm on a number of random as well as non-random graph families. The testcases were chosen based on two objectives — (i) to provide insights into the worst case behavior (in terms of time and quality) of the algorithm and (ii) to test the performance of the algorithm with instances that are likely to arise in practice. The main conclusions of the paper are the following:

• Type: Conference
• Year: 2000
• Where: SPAA
• Authors: Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.
• Keywords: Algorithm, Distributed And Parallel Computing, Edge Coloring Graphs, Randomized Algorithm, SPAA 2000