Coloring unstructured wireless multi-hop networks

DOI10.1145/1582716.1582751zbMath1291.68297OpenAlexW1997846992MaRDI QIDQ5170318

No author found.

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1582716.1582751

zbMATH Keywords

parallel algorithmscoloringdistributed algorithmsad hoc networkssensor networkslocal algorithmsunit disk graphsgrowth bounded graphsbounded independence graphsunstructured radio networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (8)

Simple Distributed Δ + 1 Coloring in the SINR Model ⋮ Nearly Optimal Local Broadcasting in the SINR Model with Feedback ⋮ Leveraging multiple channels in ad hoc networks ⋮ Bounds on contention management algorithms ⋮ An optimal maximal independent set algorithm for bounded-independence graphs ⋮ Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems ⋮ Distributed \((\varDelta + 1)\)-coloring in the physical model ⋮ Distributed backup placement

This page was built for publication: Coloring unstructured wireless multi-hop networks