Space efficient and time optimal distributed BFS tree construction

DOI10.1016/J.IPL.2008.05.016MaRDI QIDQ975469zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On the complexity of distributed BFS in ad hoc networks with spontaneous wake-up
• The first fully polynomial stabilizing algorithm for BFS tree construction
• scientific article; zbMATH DE number 4058884
• The first fully polynomial stabilizing algorithm for BFS tree construction
• Distributed algorithms for depth-first search

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Complexity of network synchronization
• Distributed Computing: A Locality-Sensitive Approach

Cited in

(4)

• The first fully polynomial stabilizing algorithm for BFS tree construction
• The first fully polynomial stabilizing algorithm for BFS tree construction
• On the complexity of distributed BFS in ad hoc networks with spontaneous wake-up
• scientific article; zbMATH DE number 2036580 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975469)