Pages that link to "Item:Q4216145"
From MaRDI portal
The following pages link to Fast Distributed Construction of Smallk-Dominating Sets and Applications (Q4216145):
Displayed 36 items.
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks (Q635294) (← links)
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- An efficient distributed algorithm for canonical labeling on directed split-stars (Q1003736) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem (Q1625600) (← links)
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
- A distributed algorithm to find \(k\)-dominating sets (Q1827867) (← links)
- New bounds for multi-label interval routing (Q1884964) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- A fast distributed approximation algorithm for minimum spanning trees (Q1954259) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- (Q2741487) (← links)
- Sparsifying Congested Cliques and Core-Periphery Networks (Q2835033) (← links)
- TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS (Q2905278) (← links)
- Constructing near spanning trees with few local inspections (Q2977565) (← links)
- Local Maps: New Insights into Mobile Agent Algorithms (Q3540225) (← links)
- On the Microscopic View of Time and Messages (Q4686647) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- An efficient distributed algorithm for constructing small dominating sets (Q5138380) (← links)
- Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892) (← links)
- Constant-time distributed dominating set approximation (Q5917933) (← links)
- Distributed MST for constant diameter graphs (Q5919895) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs (Q6202219) (← links)