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

DOI10.1016/J.TCS.2008.11.008MaRDI QIDQ1008738zbMATH OpenOpenAlexFDO

Authors 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

edge colouringgeometric graphslocal algorithmlocation awarenessunit disk graphswedgewireless network

Mathematics Subject Classification ID

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

Recommendations

• Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
• Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs
• Local 7-coloring for planar subgraphs of unit disk graphs
• Local construction and coloring of spanners of location aware unit disk graphs
• Local Algorithms for Edge Colorings in UDGs

Cites work

• Distributed Computing: A Locality-Sensitive Approach
• scientific article; zbMATH DE number 1507300 (Why is no real title available?)
• scientific article; zbMATH DE number 6469247 (Why is no real title available?)
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• Locality in Distributed Graph Algorithms
• On circuits and subgraphs of chromatic graphs
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Simple heuristics for unit disk graphs
• The NP-Completeness of Edge-Coloring
• What Can be Computed Locally?

Cited in

(2)

• Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
• Analysing local algorithms in location-aware quasi-unit-disk graphs

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

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