Some simple distributed algorithms for sparse networks

Authors:
Alessandro Panconesi;Romeo Rizzi
Affiliations:
DSI, Universit´ La Sapienza di Roma, Via Salaria 113, 00198 Roma, Italy;BRICS, University of Århus, 8000 Århus C, Denmark
Venue:
Distributed Computing
Year:
2001

Citing 5
Cited 28

Parallel (&Dgr;+1)-coloring of constant-degree graphs

Information Processing Letters
Parallel symmetry-breaking in sparse graphs

SIAM Journal on Discrete Mathematics
Locality in distributed graph algorithms

SIAM Journal on Computing
Analysis of approximate algorithms for edge-coloring bipartite graphs

Information Processing Letters
A faster distributed algorithm for computing maximal matchings deterministically

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing

Coloring unstructured radio networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Efficient interference-aware TDMA link scheduling for static wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms

Theoretical Computer Science
Distributed weighted vertex cover via maximal matchings

ACM Transactions on Algorithms (TALG)
The coverage-control optimization in sensor network subject to sensing area

Computers & Mathematics with Applications
Distributed (δ+1)-coloring in linear (in δ) time

Proceedings of the forty-first annual ACM symposium on Theory of computing
Distributed and parallel algorithms for weighted vertex cover and other covering problems

Proceedings of the 28th ACM symposium on Principles of distributed computing
Coloring unstructured wireless multi-hop networks

Proceedings of the 28th ACM symposium on Principles of distributed computing
Local Algorithms: Self-stabilization on Speed

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Rematch: a highly reliable scheduling algorithm on heterogeneous wireless mesh network

The Journal of Supercomputing
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A local 2-approximation algorithm for the vertex cover problem

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed algorithms for edge dominating sets

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Simulating sparse Hamiltonians with star decompositions

TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Deterministic dominating set construction in networks with bounded degree

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Toward more localized local algorithms: removing assumptions concerning global knowledge

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
Combinatorial algorithms for distributed graph coloring

DISC'11 Proceedings of the 25th international conference on Distributed computing
Approximation of self-stabilizing vertex cover less than 2

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Distributed weighted vertex cover via maximal matchings

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On greedy graph coloring in the distributed model

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Distributed approximation algorithms in unit-disk graphs

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Distributed maximal matching: greedy is optimal

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the locality of some NP-complete problems

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Distributed approximations for packing in unit-disk graphs

DISC'07 Proceedings of the 21st international conference on Distributed Computing
Distributed computing with advice: information sensitivity of graph coloring

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Effective channel assignments in cognitive radio networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give simple, deterministic, distributed algorithms for computing maximal matchings, maximal independent sets and colourings. We show that edge colourings with at most 2Δ-1 colours, and maximal matchings can be computed within O(log* n + Δ) deterministic rounds, where Δ is the maximum degree of the network. We also show how to find maximal independent sets and (Δ + 1)-vertex colourings within O(log* n + Δ2) deterministic rounds. All hidden constants are very small and the algorithms are very simple.