Local edge colouring of Yao-like subgraphs of unit disk graphs

DOI10.1016/j.tcs.2008.11.008zbMath1163.68032OpenAlexW2162312358MaRDI QIDQ1008738

J. Martínez

Publication date: 30 March 2009

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

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

zbMATH Keywords

wireless networkgeometric graphswedgeedge colouringunit disk graphslocal algorithmlocation awareness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Analysing local algorithms in location-aware quasi-unit-disk graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• On circuits and subgraphs of chromatic graphs
• The NP-Completeness of Edge-Coloring
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Locality in Distributed Graph Algorithms
• Distributed Computing: A Locality-Sensitive Approach
• Simple heuristics for unit disk graphs
• What Can be Computed Locally?

This page was built for publication: Local edge colouring of Yao-like subgraphs of unit disk graphs