Pages that link to "Item:Q5361460"
From MaRDI portal
The following pages link to Fast distributed construction of <i>k</i>-dominating sets and applications (Q5361460):
Displaying 13 items.
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Distributed algorithms for weighted problems in sparse graphs (Q866546) (← links)
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- Distributed Broadcast Revisited: Towards Universal Optimality (Q3449512) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- (Q5090922) (← links)
- (Q5090925) (← links)
- (Q5090930) (← links)
- A linear-time optimal-message distributed algorithm for minimum spanning trees (Q5138511) (← links)