Fast Distributed Construction of Smallk-Dominating Sets and Applications
From MaRDI portal
Recommendations
- A distributed algorithm for k-dominating sets
- An efficient distributed algorithm for constructing small dominating sets
- A distributed algorithm to find \(k\)-dominating sets
- A fast distributed approximation algorithm for minimum spanning trees
- A faster distributed protocol for constructing a minimum spanning tree
Cited in
(42)- A distributed algorithm for k-dominating sets
- Constructing near spanning trees with few local inspections
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
- On the microscopic view of time and messages
- Fast deterministic distributed algorithms for sparse spanners
- scientific article; zbMATH DE number 2079403 (Why is no real title available?)
- Low-congestion shortcut and graph parameters
- Distributed verification of minimum spanning trees
- Approximate minimum directed spanning trees under congestion
- Latency, capacity, and distributed minimum spanning trees
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
- Locally verifiable distributed SNARGs
- A faster distributed protocol for constructing a minimum spanning tree
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
- New bounds for multi-label interval routing
- A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
- A fast distributed approximation algorithm for minimum spanning trees
- A distributed algorithm for minimum distance-k domination in trees
- Distributed MST for constant diameter graphs
- Sparsifying congested cliques and core-periphery networks
- Sublinear fully distributed partition with applications
- Labeling schemes for tree representation
- Deterministic distributed construction of T-dominating sets in time T
- Time optimal algorithms for black hole search in rings
- Local Maps: New Insights into Mobile Agent Algorithms
- On efficient distributed construction of near optimal routing schemes
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
- An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
- An efficient distributed algorithm for canonical labeling on directed split-stars
- Faster leader election via mobile agents and its applications
- An efficient distributed algorithm for constructing small dominating sets
- A distributed algorithm to find \(k\)-dominating sets
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- Finding a small vertex cut on distributed networks
- A distributed algorithm for directed minimum-weight spanning tree
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- Distributed approximation of capacitated dominating sets
- Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
- Local algorithms for sparse spanning graphs
- Autonomous domination
- Node and edge averaged complexities of local graph problems
- Constant-time distributed dominating set approximation
This page was built for publication: Fast Distributed Construction of Smallk-Dominating Sets and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4216145)
