Local algorithms for edge colorings in UDGs

DOI10.1016/j.tcs.2011.05.005zbMath1223.68082OpenAlexW2013435921MaRDI QIDQ638541

Andreas Wiese, Fenghui Zhang, Iyad A. Kanj

Publication date: 12 September 2011

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

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

zbMATH Keywords

unit disk graphsstrong edge coloring problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)

Related Items (1)

Note on coloring of double disk graphs

Cites Work

• Link scheduling in wireless sensor networks: distributed edge-coloring revisited
• A constructive proof of Vizing's theorem
• On the computational complexity of strong edge coloring
• Algorithms for finding distance-edge-colorings of graphs
• The NP-Completeness of Edge-Coloring
• Locality in Distributed Graph Algorithms
• Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs

This page was built for publication: Local algorithms for edge colorings in UDGs