Tushar Bisht
ABSTRACT
A t-ruling set of a graph G = (V, E) is a vertex-subset S ⊆ V that is independent and satisfies the property that every vertex v ∈ V is at a distance of at most t hops from some vertex in S. A maximal independent set (MIS) is a 1-ruling set. Extending results from Kothapalli et al. (FSTTCS 2012) this note presents a randomized algorithm for computing, with high probability, a t-ruling set in O(t ⋅ log1/(t-1)n) rounds for 2 < t ≤ √(log log n) and in (O(√(log log n))) rounds for t > √(log log n).
- Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The locality of distributed symmetry breaking. In Proc. of IEEE FOCS, 2012. Google Scholar
Digital Library
- Beat Gfeller and Elias Vicari. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In Proc. ACM PODC, pages 53--60, 2007. Google ScholarDigital Library
- Kishore Kothapalli and Sriram V. Pemmaraju. Super-fast 3-ruling sets. In In Proc. of Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 136--147, 2012.Google Scholar
- Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. Local computation: Lower and upper bounds. CoRR, abs/1011.5470, 2010.Google Scholar
- N. Linial. Locality in distributed graph algorithms. SIAM Journal of Computing, 21:193--201, 1992. Google ScholarDigital Library
- M. Luby. A simple parallel algorithm for the maximal independent set. SIAM Journal on Computing, 15:1036--1053, 1986. Google ScholarDigital Library
- Johannes Schneider, Michael Elkin, and Roger Wattenhofer. Symmetry breaking depending on the chromatic number or the neighborhood growth. Theor. Comput. Sci., 509:40--50, October 2013. Google ScholarDigital Library
Index Terms
- Brief announcement: Super-fast t-ruling sets
Recommendations
A new technique for distributed symmetry breaking
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingWe introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three randomized algorithms for distributed (vertex or edge) coloring improving on ...
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingWe study local symmetry breaking problems in the Congest model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. Our work is motivated by the following central question: can we break the long-...
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingOver the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially ...
Comments