Tight bounds for MIS in multichannel radio networks
From MaRDI portal
Publication:1664167
DOI10.1007/978-3-662-48653-5_38zbMath1394.68265arXiv1508.04390OpenAlexW2231535830MaRDI QIDQ1664167
Publication date: 24 August 2018
Full work available at URL: https://arxiv.org/abs/1508.04390
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Deterministic multi-channel information exchange ⋮ Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
This page was built for publication: Tight bounds for MIS in multichannel radio networks