Pages that link to "Item:Q1625605"
From MaRDI portal
The following pages link to A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605):
Displaying 13 items.
- Fast distributed network decompositions and covers (Q676658) (← links)
- Simple and efficient network decomposition and synchronization (Q1575640) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- A fast algorithm for bounded generalized processing networks (Q4285457) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS (Q5056602) (← links)
- Polylogarithmic-time deterministic network decomposition and distributed derandomization (Q5144922) (← links)
- Fast network decomposition (Q5348849) (← links)
- Distributed Strong Diameter Network Decomposition (Q5361938) (← links)
- Improved network decompositions using small messages with applications on MIS, neighborhood covers, and beyond (Q6487534) (← links)
- Distributed domination on sparse graph classes (Q6614403) (← links)
