An optimal bit complexity randomized distributed MIS algorithm

@article{Mtivier2010AnOB,
  title={An optimal bit complexity randomized distributed MIS algorithm},
  author={Y. M{\'e}tivier and J. Robson and N. Saheb-Djahromi and A. Zemmari},
  journal={Distributed Computing},
  year={2010},
  volume={23},
  pages={331-340}
}
We present a randomized distributed maximal independent set (MIS) algorithm for arbitrary graphs of size n that halts in time O(log n) with probability 1 − o(n−1), and only needs messages containing 1 bit. Thus, its bit complexity par channel is O(log n). We assume that the graph is anonymous: unique identities are not available to distinguish between the processes; we only assume that each vertex distinguishes between its neighbours by locally known channel names. Furthermore we do not assume… Expand
An Improved Distributed Algorithm for Maximal Independent Set
Tight Analysis of Parallel Randomized Greedy MIS
Tight Analysis of Parallel Randomized Greedy MIS
Tight Analysis of Randomized Greedy MIS
Fair Maximal Independent Sets
The Locality of Distributed Symmetry Breaking
Brief Announcement: Using Read-k Inequalities to Analyze a Distributed MIS Algorithm
MIS on trees
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
Distributed coloring in Õ (√log n) Bit Rounds
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
Locality in Distributed Graph Algorithms
  • N. Linial
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1992
On the complexity of distributed graph coloring
Network decomposition and locality in distributed computation
Bit complexity of breaking and achieving symmetry in chains and rings
What can be computed locally?
...
1
2
3
...