Fast distributed construction of k-dominating sets and applications
From MaRDI portal
Publication:5361460
DOI10.1145/224964.224990zbMath1376.68161MaRDI 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
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68W15: Distributed algorithms
Related Items
Near-Optimal Distributed Maximum Flow, Unnamed Item, Unnamed Item, Unnamed Item, A linear-time optimal-message distributed algorithm for minimum spanning trees, Fast and compact self-stabilizing verification, computation, and fault detection of an MST, Distributed algorithms for weighted problems in sparse graphs, Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model, Fast distributed approximation for TAP and 2-edge-connectivity, Combinatorial algorithms for distributed graph coloring, Low-congestion shortcuts without embedding, Distributed Broadcast Revisited: Towards Universal Optimality, Fast Distributed Approximation for TAP and 2-Edge-Connectivity
