Super-Fast 3-Ruling Sets.
From MaRDI portal
Publication:2957487
DOI10.4230/LIPIcs.FSTTCS.2012.136zbMath1354.68126arXiv1207.3099OpenAlexW2963197483MaRDI QIDQ2957487
Kishore Kothapalli, Sriram V. Pemmaraju
Publication date: 26 January 2017
Full work available at URL: https://arxiv.org/abs/1207.3099
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)
Related Items (8)
A fast network-decomposition algorithm and its applications to constant-time distributed computation ⋮ A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation ⋮ Distributed reconfiguration of maximal independent sets ⋮ Lessons from the congested clique applied to MapReduce ⋮ Distributed Symmetry Breaking on Power Graphs via Sparsification ⋮ An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model ⋮ Distributed Reconfiguration of Maximal Independent Sets ⋮ Distributed Lower Bounds for Ruling Sets
This page was built for publication: Super-Fast 3-Ruling Sets.
