Maximal independent sets in radio networks
- 17 July 2005
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 148-157
- https://doi.org/10.1145/1073814.1073842
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Coloring unstructured radio networksPublished by Association for Computing Machinery (ACM) ,2005
- Initializing newly deployed ad hoc and sensor networksPublished by Association for Computing Machinery (ACM) ,2004
- What cannot be computed locally!Published by Association for Computing Machinery (ACM) ,2004
- A better wake-up in radio networksPublished by Association for Computing Machinery (ACM) ,2004
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio NetworksSIAM Journal on Computing, 1998
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- A lower bound for radio broadcastJournal of Computer and System Sciences, 1991
- On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomizationPublished by Association for Computing Machinery (ACM) ,1987
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986