Distributed coloring and the local structure of unit-disk graphs

DOI10.1016/j.tcs.2022.12.024OpenAlexW3175311986MaRDI QIDQ5925586

Arnaud de Mesmay, Sébastien Julliot, Louis Esperet

Publication date: 30 January 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.12.024

zbMATH Keywords

average degreeunit-disk graphsdistributed coloring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysing local algorithms in location-aware quasi-unit-disk graphs
• An optimal maximal independent set algorithm for bounded-independence graphs
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
• Unit disk graphs
• On coloring unit disk graphs
• Graph imperfection. I
• Distributed algorithms for fractional coloring
• Survey of local algorithms
• Locality in Distributed Graph Algorithms
• A survey of χ‐boundedness
• LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS
• Distributed coloring and the local structure of unit-disk graphs

This page was built for publication: Distributed coloring and the local structure of unit-disk graphs