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
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
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Navigating nets: simple algorithms for proximity search
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Triangulation and Embedding Using Small Sets of Beacons
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
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
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Energy conservation via domatic partitions
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A fast localized algorithm for scheduling sensors
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Distributed almost exact approximations for minor-closed families
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
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
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Distributed packing in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Ad hoc networks beyond unit disk graphs
Wireless Networks
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local, distributed weighted matching on general and wireless topologies
Proceedings of the fifth international workshop on Foundations of mobile computing
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Construction of virtual backbone on growth-bounded graph with variable transmission range
WSEAS Transactions on Computers
The coverage-control optimization in sensor network subject to sensing area
Computers & Mathematics with Applications
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
Approximation and Online Algorithms
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Brief announcement: combine -- an improved directory-based consistency protocol
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Distributed algorithms for approximating wireless network capacity
INFOCOM'10 Proceedings of the 29th conference on Information communications
What is the use of collision detection (in wireless networks)?
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
Space-efficient local computation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed approximation algorithms in unit-disk graphs
DISC'06 Proceedings of the 20th international conference on Distributed Computing
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
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
Distributed approximations for packing in unit-disk graphs
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Feedback from nature: an optimal distributed algorithm for maximal independent set selection
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Maximal independent sets in multichannel radio networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Information and Computation
| Hi-index | 0.00 |
The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time randomized algorithm for general graphs [20], no deterministic polylogarithmic algorithm is known. In this paper, we study the problem in graphs with bounded growth, an important family of graphs which includes the well-known unit disk graph and many variants thereof. Particularly, we propose a deterministic algorithm that computes a maximal independent set in time O(log Δ· log*n) in graphs with bounded growth, where n and Δ denote the number of nodes and the maximal degree in G, respectively.