Local algorithms for edge colorings in UDGs

DOI10.1016/J.TCS.2011.05.005MaRDI QIDQ638541zbMATH OpenOpenAlexFDO

Authors Iyad Kanj, Andreas Wiese, Fenghui Zhang

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) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15) Parallel algorithms in computer science (68W10)

Recommendations

• Local Algorithms for Edge Colorings in UDGs
• Distributed coloring and the local structure of unit-disk graphs
• Distributed coloring and the local structure of unit-disk graphs
• Local construction and coloring of spanners of location aware unit disk graphs
• Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs

Cites work

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

Cited in

(5)

• Link scheduling in wireless sensor networks: distributed edge-coloring revisited
• Local Algorithms for Edge Colorings in UDGs
• Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
• Distance edge coloring and collision-free communication in wireless sensor networks
• Note on coloring of double disk graphs

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

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