STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms
SIAM Journal on Computing
The distributed bit complexity of the ring: from the anonymous to the non-anonymous case
Information and Computation
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing
Communication complexity
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Simple distributed&Dgr; + 1-coloring of graphs
Information Processing Letters
Simple and efficient network decomposition and synchronization
Theoretical Computer Science
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Sublinear Fully Distributed Partition with Applications
Theory of Computing Systems
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Refinement-based verification of local synchronization algorithms
FM'11 Proceedings of the 17th international conference on Formal methods
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
On the time and the bit complexity of distributed randomised anonymous ring colouring
Theoretical Computer Science
Information and Computation
| Hi-index | 0.00 |
We present and analyse a very simple randomised distributed vertex colouring algorithm for arbitrary graphs of size n that halts in time O(logn) with probability 1-o(n^-^1). Each message containing 1 bit, its bit complexity per channel is O(logn). From this algorithm, we deduce and analyse a randomised distributed vertex colouring algorithm for arbitrary graphs of maximum degree @D and size n that uses at most @D+1 colours and halts in time O(logn) with probability 1-o(n^-^1). We also obtain a partition algorithm for arbitrary graphs of size n that builds a spanning forest in time O(logn) with probability 1-o(n^-^1). We study some parameters such as the number, the size and the radius of trees of the spanning forest.