Distributed coloring and the local structure of unit-disk graphs
From MaRDI portal
Publication:5918711
DOI10.1007/978-3-030-89240-1_5zbMath1498.68367arXiv2106.12322OpenAlexW3208182919MaRDI QIDQ5918711
Louis Esperet, Arnaud de Mesmay, Sébastien Julliot
Publication date: 24 June 2022
Published in: Algorithms for Sensor Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.12322
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- Analysing local algorithms in location-aware quasi-unit-disk graphs
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- Unit disk graphs
- Colouring proximity graphs in the plane
- On coloring unit disk graphs
- Graph imperfection. I
- Survey of local algorithms
- The Locality of Distributed Symmetry Breaking
- Locality in Distributed Graph Algorithms
- Revisiting Tucker's Algorithm to Color Circular Arc Graphs
- Random channel assignment in the plane
- A survey of χ‐boundedness
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Faster Deterministic Distributed Coloring Through Recursive List Coloring
- LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS
- (2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
This page was built for publication: Distributed coloring and the local structure of unit-disk graphs
