Pages that link to "Item:Q2575833"

The following pages link to Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833):

Displaying 13 items.

• Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks (Q436764) (← links)
• A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Testing equality under the local broadcast model (Q2117734) (← links)
• The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
• Distributed strong diameter network decomposition (Q2672581) (← links)
• Weakly Connected Domination in Graphs (Q2839237) (← links)
• Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
• A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
• Multipath Spanners via Fault-Tolerant Spanners (Q4916037) (← links)
• The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
• Distributed construction of purely additive spanners (Q5915631) (← links)
• Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)