Space efficient and time optimal distributed BFS tree construction

DOI10.1016/j.ipl.2008.05.016zbMath1191.68847OpenAlexW1974070507MaRDI QIDQ975469

Ajoy K. Datta, Franck Petit, Christian Boulinier, Lawrence L. Larmore

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.016

zbMATH Keywords

distributed computingBFS tree

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Complexity of network synchronization
• Distributed Computing: A Locality-Sensitive Approach

This page was built for publication: Space efficient and time optimal distributed BFS tree construction