Simple and efficient network decomposition and synchronization

DOI10.1016/S0304-3975(98)00206-0zbMath0944.68002OpenAlexW2126251084MaRDI QIDQ1575640

Sagi Snir, Shlomo Moran

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

zbMATH Keywords

graph decompositionssynchronizersasynchronous communication networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Sublinear fully distributed partition with applications ⋮ Local Maps: New Insights into Mobile Agent Algorithms ⋮ Fast deterministic distributed algorithms for sparse spanners ⋮ About randomised distributed graph colouring and graph partition 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

This page was built for publication: Simple and efficient network decomposition and synchronization