Fast distributed network decompositions and covers

DOI10.1006/jpdc.1996.0159zbMath0869.68051OpenAlexW1989381030MaRDI QIDQ676658

David Peleg, Bonnie Berger, Baruch Awerbuch, Lenore J. Cowen

Publication date: 1996

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8c82e010ffef16086005e87ec39ac443bdd170a3

zbMATH Keywords

network decompositiondeterministic sublinear-time distributed algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Related Items (10)

A fast network-decomposition algorithm and its applications to constant-time distributed computation ⋮ A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation ⋮ A faster distributed protocol for constructing a minimum spanning tree ⋮ Distributed strong diameter network decomposition ⋮ Network Decomposition and Distributed Derandomization (Invited Paper) ⋮ On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Sublinear fully distributed partition with applications ⋮ Fast deterministic distributed algorithms for sparse spanners ⋮ About randomised distributed graph colouring and graph partition algorithms ⋮ Local mending

This page was built for publication: Fast distributed network decompositions and covers