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
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Fast distributed graph coloring with O(&Dgr;) colors
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
Distributed approximation: a survey
ACM SIGACT News
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Complexity analysis of a decentralised graph colouring algorithm
Information Processing Letters
NetComplex: a complexity metric for networked system designs
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of 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
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Randomized distributed algorithm for vertex coloring
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
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
About randomised distributed graph colouring and graph partition algorithms
Information and Computation
A policy-based constraint-solving platform towards extensible wireless channel selection and routing
Proceedings of the Workshop on Programmable Routers for Extensible Services of Tomorrow
Distributed graph coloring for self-organization in LTE networks
Journal of Electrical and Computer Engineering - Special issue on LTE/LTE-advanced cellular communication networks
Distributed decision problems: the locality angle
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
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
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Space-efficient local computation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Distributed maximal matching: greedy is optimal
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Weak models of distributed computing, with connections to modal logic
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
On the time and the bit complexity of distributed randomised anonymous ring colouring
Theoretical Computer Science
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science
Information and Computation
| Hi-index | 0.01 |
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a distributed setting. Processors of a distributed system are nodes of an undirected graph G. There is an edge between two nodes whenever the corresponding processors can directly communicate with each other. We assume that distributed coloring algorithms start with an initial m-coloring of G. In the paper, we prove new strong lower bounds for two special kinds of coloring algorithms. For algorithms which run for a single communication round---i.e., every node of the network can only send its initial color to all its neighbors---, we show that the number of colors of the computed coloring has to be at least Ω(Δ2/log2 Δ+ log log m). If such one-round algorithms are iteratively applied to reduce the number of colors step-by-step, we prove a time lower bound of Ω(Δ/log2 Δ+ log*m) to obtain an O(Δ)-coloring. The best previous lower bounds for the two types of algorithms are Ω(log log m) and Ω(log*m), respectively.