Pages that link to "Item:Q676658"
From MaRDI portal
The following pages link to Fast distributed network decompositions and covers (Q676658):
Displaying 16 items.
- About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Simple and efficient network decomposition and synchronization (Q1575640) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Local mending (Q2097329) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS (Q5056602) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Polylogarithmic-time deterministic network decomposition and distributed derandomization (Q5144922) (← links)
- Fast network decomposition (Q5348849) (← links)
- Distributed Strong Diameter Network Decomposition (Q5361938) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Improved network decompositions using small messages with applications on MIS, neighborhood covers, and beyond (Q6487534) (← links)