Simple and efficient network decomposition and synchronization
From MaRDI portal
Publication:1575640
DOI10.1016/S0304-3975(98)00206-0zbMath0944.68002MaRDI QIDQ1575640
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00206-0
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
About randomised distributed graph colouring and graph partition algorithms, Fast deterministic distributed algorithms for sparse spanners, Sublinear fully distributed partition with applications, Local Maps: New Insights into Mobile Agent Algorithms
Cites Work
- Unnamed Item
- Low diameter graph decompositions
- Complexity of network synchronization
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Routing with Polynomial Communication-Space Trade-Off
- Sparser: A Paradigm for Running Distributed Algorithms
- Online tracking of mobile users
- Optimal distributed algorithm for minimum spanning trees revisited