Pages that link to "Item:Q4216145"

The following pages link to Fast Distributed Construction of Smallk-Dominating Sets and Applications (Q4216145):

Displaying 19 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)
• An efficient distributed algorithm for constructing small dominating sets (Q5138380) (← links)
• Node and edge averaged complexities of local graph problems (Q6071120) (← links)
• Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)