Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Distributed scheduling algorithms to improve the performance of parallel data transfers
ACM SIGARCH Computer Architecture News - Special issue on input/output in parallel computer systems
Analysis of approximate algorithms for edge-coloring bipartite graphs
Information Processing Letters
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Near-optimal, distributed edge colouring via the nibble method
ESA '95 Selected papers from the third European symposium on Algorithms
Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of simple, distributed vertex coloring algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A self-stabilizing (Δ+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems
Information Processing Letters
Randomized distributed algorithm for vertex coloring
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
| Hi-index | 0.00 |
We conduct an experimental analysis of a distributed randomized algorithm for edge coloring simple undirected graphs. The algorithm is extremely simple yet, according to the probabilistic analysis, it computes nearly optimal colorings very quickly [Grable and Panconesi 1997]. We test the algorithm on a number of random as well as nonrandom graph families.The test cases 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. Our main results include the following:(1) The empirical results obtained compare very well with the recent empirical results reported by other researchers [Durand et al. 1994, 1998; Jain and Werth 1995].(2) The empirical results confirm the bounds on the running time and the solution quality as claimed in the theoretical paper. Our results show that for certain classes of graphs the algorithm is likely to perform much better than the analysis suggests.(3) The results demonstrate that the algorithm might be well suited (from a theoretical as well as practical standpoint) for edge coloring graphs quickly and efficiently in a distributed setting.Based on our empirical study, we propose a simple modification of the original algorithm with substantially improved performance in practice.