Simple Distributed Δ + 1 Coloring in the SINR Model

DOI10.1007/978-3-319-25258-2_11zbMath1430.68202arXiv1502.02426OpenAlexW2963165401MaRDI QIDQ3460713

Fabian Fuchs, Roman Prutkin

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.02426

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Distributed algorithms (68W15)

Related Items (2)

Simple Distributed Δ + 1 Coloring in the SINR Model ⋮ Nearly Optimal Local Broadcasting in the SINR Model with Feedback

Uses Software

• Sinalgo

Cites Work

• Unnamed Item
• Distributed \((\varDelta + 1)\)-coloring in the physical model
• On local broadcasting schedules and CONGEST algorithms in the SINR model
• Coloring unstructured radio networks
• Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
• Simple Distributed Δ + 1 Coloring in the SINR Model
• The capacity of wireless networks
• Distributed Graph Coloring: Fundamentals and Recent Developments
• Coloring unstructured wireless multi-hop networks
• Local Broadcasting with Arbitrary Transmission Power in the SINR Model

This page was built for publication: Simple Distributed Δ + 1 Coloring in the SINR Model