Distributed Colouring and Communication in Rings with Local Knowledge

DOI10.1017/S0963548303006011MaRDI QIDQ4819231zbMATH OpenOpenAlexFDO

Authors Andzrej Pelc, Anders Dessmark

Publication date 24 September 2004

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548303006011

zbMATH Keywords

knowledge radius

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the time and the bit complexity of distributed randomised anonymous ring colouring
• Learning a ring cheaply and fast
• Deterministic broadcasting time with partial knowledge of the network
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
• Locality in Distributed Graph Algorithms

Cited in

(1)

• Learning a ring cheaply and fast

This page was built for publication: Distributed Colouring and Communication in Rings with Local Knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819231)