Simple and efficient network decomposition and synchronization
From MaRDI portal
Recommendations
- Fast network decomposition
- Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization
- Fast distributed network decompositions and covers
- scientific article; zbMATH DE number 4055012
- A fast network-decomposition algorithm and its applications to constant-time distributed computation
Cites work
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Complexity of network synchronization
- Low diameter graph decompositions
- Online tracking of mobile users
- Optimal distributed algorithm for minimum spanning trees revisited
- Routing with Polynomial Communication-Space Trade-Off
- Sparser: A Paradigm for Running Distributed Algorithms
Cited in
(6)- Fast deterministic distributed algorithms for sparse spanners
- Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization
- Sublinear fully distributed partition with applications
- Local Maps: New Insights into Mobile Agent Algorithms
- About randomised distributed graph colouring and graph partition algorithms
- Optimized network structure for full-synchronization
This page was built for publication: Simple and efficient network decomposition and synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575640)
