STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms
SIAM Journal on Computing
Removing randomness in parallel computation without a processor penalty
Journal of Computer and System Sciences
The distributed bit complexity of the ring: from the anonymous to the non-anonymous case
Information and Computation
Communication complexity
Simple distributed&Dgr; + 1-coloring of graphs
Information Processing Letters
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)
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
About randomised distributed graph colouring and graph partition algorithms
Information and Computation
| Hi-index | 0.00 |
Let G = (V ,E ) be a simple undirected graph. A vertex colouring of G assigns colours to each vertex in such a way that neighbours have different colours. In this paper we discuss how efficient (time and bits) vertex colouring may be accomplished by exchange of bits between neighbouring vertices. The distributed complexity of vertex colouring is of fundamental interest for the study and analysis of distributed computing. Usually, the topology of a distributed system is modelled by a graph and paradigms of distributed systems are encoded by classical problems in graph theory; among these classical problems one may cite the problems of vertex colouring, computing a maximal independent set, finding a vertex cover or finding a maximal matching. Each solution to one of these problems is a building block for many distributed algorithms: symmetry breaking, topology control, routing, resource allocation.