Beeping a maximal independent set
DOI10.1007/s00446-012-0175-7zbMath1311.68024arXiv1206.0150OpenAlexW2568091325WikidataQ57203501 ScholiaQ57203501MaRDI QIDQ2441534
Ziv Bar-Joseph, Bernhard Haeupler, Noga Alon, Yehuda Afek, Fabian Kuhn, Alejandro Cornejo
Publication date: 25 March 2014
Published in: Lecture Notes in Computer Science, Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.0150
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed systems (68M14)
Related Items (25)
Cites Work
- Unnamed Item
- Unnamed Item
- An optimal bit complexity randomized distributed MIS algorithm
- Fast radio broadcasting with advice
- A log-star distributed maximal independent set algorithm for growth-bounded graphs
- A Biological Solution to a Fundamental Distributed Computing Problem
- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract)
- The price of being near-sighted
- What Is the Use of Collision Detection (in Wireless Networks)?
- Deploying Wireless Networks with Beeps
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Distributed Computing: A Locality-Sensitive Approach
- Maximal independent sets in radio networks
- Distributed Computing
- What cannot be computed locally!
- Self-organizing Desynchronization and TDMA on Wireless Sensor Networks
This page was built for publication: Beeping a maximal independent set