Fast network decomposition
From MaRDI portal
Publication:5348849
DOI10.1145/135419.135456zbMath1370.68226OpenAlexW2020547589MaRDI QIDQ5348849
Bonnie Berger, Baruch Awerbuch, Lenore J. Cowen, David Peleg
Publication date: 21 August 2017
Published in: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/135419.135456
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (6)
Generating sparse 2—spanners ⋮ Low-diameter graph decomposition is in NC ⋮ Distributed Disaster Disclosure ⋮ Distributed distance-\(r\) covering problems on sparse high-girth graphs ⋮ Distributed distance-\(r\) covering problems on sparse high-girth graphs ⋮ Graph theoretical issues in computer networks
This page was built for publication: Fast network decomposition