A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
Locality in distributed graph algorithms
SIAM Journal on Computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the complexity of distributed network decomposition
Journal of Algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Simple distributed&Dgr; + 1-coloring of graphs
Information Processing Letters
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Local computations on static and dynamic graphs
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Some simple distributed algorithms for sparse networks
Distributed Computing
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributive graph algorithms Global solutions from local data
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Randomized distributed algorithm for vertex coloring
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
A new technique for distributed symmetry breaking
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Automatic link numbering and source routed multicast
AIMS'10 Proceedings of the Mechanisms for autonomous management of networks and services, and 4th international conference on Autonomous infrastructure, management and security
Deploying wireless networks with beeps
DISC'10 Proceedings of the 24th international conference on Distributed computing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed deterministic edge coloring using bounded neighborhood independence
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Journal of the ACM (JACM)
Distributed coloring depending on the chromatic number or the neighborhood growth
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Trading bit, message, and time complexity of distributed algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
Distributed ($#916;+1)-coloring in the physical model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Distributed maximal matching: greedy is optimal
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the locality of some NP-complete problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Randomized distributed decision
DISC'12 Proceedings of the 26th international conference on Distributed Computing
ACM Computing Surveys (CSUR)
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Fast distributed coloring algorithms for triangle-free graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The distributed (Δ + 1)-coloring problem is one of most fundamental and well-studied problems in Distributed Algorithms. Starting with the work of Cole and Vishkin in 86, there was a long line of gradually improving algorithms published. The current state-of-the-art running time is O(Δ log Δ + log* n), due to Kuhn and Wattenhofer, PODC'06. Linial (FOCS'87) has proved a lower bound of 1/2 log* n for the problem, and Szegedy and Vishwanathan (STOC'93) provided a heuristic argument that shows that algorithms from a wide family of locally iterative algorithms are unlikely to achieve running time smaller than Θ(Δ log Δ). We present a deterministic (Δ + 1)-coloring distributed algorithm with running time O(Δ) + 1/2 log* n. We also present a tradeoff between the running time and the number of colors, and devise an O(Δ • t)-coloring algorithm with running time O(Δ / t + log* n), for any parameter t, 1 1-ε, for an arbitrarily small constant ε, 0