A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Efficient parallel algorithms for edge coloring problems
Journal of Algorithms
Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The greedy algorithm is optimal for on-line edge coloring
Information Processing Letters
Analysis of approximate algorithms for edge-coloring bipartite graphs
Information Processing Letters
Applying randomized edge coloring algorithms to distributed communication: an experimental study
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
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
Runtime prediction of real programs on real machines
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
Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited
Journal of Parallel and Distributed Computing
A route-based scheduling in wireless multi-hop mesh networks for collision avoidance
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
The effect of information on scheduling performance in multi-hop wireless networks
IEEE Transactions on Wireless Communications
A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
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 [12]. We test the algorithm on a number of random as well as non-random 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:The empirical results obtained compare very well with the recent empirical results reported by other researchers [5, 6, 18].The empirical 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 suggestsThe results demonstrate that the algorithm might be well suited (from a theoretical as well as practical stand-point) 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.