On the Complexity of Distributed Network Decomposition
From MaRDI portal
Publication:4876697
DOI10.1006/jagm.1996.0017zbMath0844.68005MaRDI QIDQ4876697
Aravind Srinivasan, Alessandro Panconesi
Publication date: 6 May 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6128
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
Fast deterministic distributed algorithms for sparse spanners, Local Maps: New Insights into Mobile Agent Algorithms