Fast distributed construction of k-dominating sets and applications
From MaRDI portal
Publication:5361460
DOI10.1145/224964.224990zbMath1376.68161OpenAlexW2005900781MaRDI QIDQ5361460
Publication date: 29 September 2017
Published in: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/224964.224990
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 (13)
Distributed Broadcast Revisited: Towards Universal Optimality ⋮ Distributed algorithms for weighted problems in sparse graphs ⋮ Low-congestion shortcuts without embedding ⋮ Fast Distributed Approximation for TAP and 2-Edge-Connectivity ⋮ A linear-time optimal-message distributed algorithm for minimum spanning trees ⋮ Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Fast distributed approximation for TAP and 2-edge-connectivity ⋮ Combinatorial algorithms for distributed graph coloring ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Near-Optimal Distributed Maximum Flow
This page was built for publication: Fast distributed construction of k-dominating sets and applications
