A fast and simple randomized parallel algorithm for maximal matching
Information Processing Letters
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms
SIAM Journal on Computing
Journal of Computer and System Sciences
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Leveraging Linial's Locality Limit
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Optimal clock synchronization in networks
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Bounds on Contention Management Algorithms
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Randomized distributed algorithm for vertex coloring
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Distributed algorithms for approximating wireless network capacity
INFOCOM'10 Proceedings of the 29th conference on Information communications
A new technique for distributed symmetry breaking
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
What is the use of collision detection (in wireless networks)?
DISC'10 Proceedings of the 24th international conference on Distributed computing
Deploying wireless networks with beeps
DISC'10 Proceedings of the 24th international conference on Distributed computing
Minimum dominating set approximation in graphs of bounded arboricity
DISC'10 Proceedings of the 24th international conference on Distributed computing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed deterministic edge coloring using bounded neighborhood independence
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed coloring depending on the chromatic number or the neighborhood growth
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
Distributed approximation of cellular coverage
Journal of Parallel and Distributed Computing
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Distributed ($#916;+1)-coloring in the physical model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Asynchronous leader election and MIS using abstract MAC layer
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Shifting strategy for geometric graphs without geometry
Journal of Combinatorial Optimization
Super-fast distributed algorithms for metric facility location
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
ACM Computing Surveys (CSUR)
Maximal independent sets in multichannel radio networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science
| Hi-index | 0.00 |
We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growth-bounded graphs (GBG) our deterministic algorithm finishes in O(log* n) time, n being the number of nodes. In light of Linial's Ω(log* n) lower bound our algorithm is asymptotically optimal. Our algorithm answers prominent open problems in the ad hoc/sensor network domain. For instance, it solves the connected dominating set problem for unit disk graphs in O(log* n) time, exponentially faster than the state-of-the-art algorithm. With a new extension our algorithm also computes a delta+1 coloring in O(log* n) time, where delta is the maximum degree of the graph.