On a space-optimal distributed traversal algorithm

DOI10.1007/3-540-45438-1_15MaRDI QIDQ4446611zbMATH OpenFDO

Authors Sébastien Tixeuil

Publication date 2 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2194/21940216.htm

Mathematics Subject Classification ID

Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Optimized versions of a distributed algorithm for solving path problems
• Space efficient and time optimal distributed BFS tree construction
• Distributed algorithms for ultrasparse spanners and linear size skeletons
• Distributed algorithms for ultrasparse spanners and linear size skeletons
• Distributed algorithms for depth-first search
• Distributed spanner approximation
• Distributed Spanner Approximation
• Optimal Distributed Covering Algorithms

Cited in

(2)

• scientific article; zbMATH DE number 4050991 (Why is no real title available?)
• A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem

This page was built for publication: On a space-optimal distributed traversal algorithm

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