A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Probabilistic recurrence relations
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A parallel graph coloring heuristic
SIAM Journal on Scientific Computing
Removing randomness in parallel computation without a processor penalty
Journal of Computer and System Sciences
Nearly optimal distributed edge coloring in O(log log n) rounds
Random Structures & Algorithms
Probabilistic recurrence relations revisited
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Simple distributed&Dgr; + 1-coloring of graphs
Information Processing Letters
An experimental study of a simple, distributed edge coloring algorithm
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
New methods to color the vertices of a graph
Communications of the ACM
Fast distributed algorithms for Brooks-Vizing colorings
Journal of Algorithms
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
Parallel Distance-k Coloring Algorithms for Numerical Optimization
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Extremal Properties of Three-Dimensional Sensor Networks with Applications
IEEE Transactions on Mobile Computing
An experimental study of a simple, distributed edge-coloring algorithm
Journal of Experimental Algorithmics (JEA)
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Distributed Clustering Techniques for Improving Lifetime in Two-Tiered Sensor Networks
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
A data collection protocol for real-time sensor applications
Pervasive and Mobile Computing
Randomized distributed algorithm for vertex coloring
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Distributed graph coloring in a few rounds
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A scalable parallel graph coloring algorithm for distributed memory computers
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Speeding up parallel graph coloring
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
We perform an extensive experimental evaluation of very simple, distributed, randomized algorithms for (Δ + 1)- and so-called Brooks-Vizing vertex colorings, i.e., colorings using considerably fewer than Δ colors. We consider variants of algorithms known from the literature, boosting them with a distributed independent set computation. Our study clearly determines the relative performance of the algorithms w.r.t. the number of communication rounds and the number of colors. The results are confirmed by all the experiments and instance families. The empirical evidence shows that some algorithms are extremely fast and very effective, thus being amenable to be used in practice.