Distributed algorithms for depth-first search

DOI10.1016/S0020-0190(96)00141-XzbMath0875.68474OpenAlexW2030218931MaRDI QIDQ1349993

George Havas, S. A. M. Makki

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00141-x

zbMATH Keywords

Distributed algorithmsDistributed systemsDepth-first searchCommunication graphs

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (4)

Distributed algorithms for depth-first search ⋮ A note on the message complexity of Cidon's distributed depth-first search algorithm ⋮ Message and time efficient multi-broadcast schemes ⋮ Some remarks on distributed depth-first search.

Cites Work

• Depth-first search is inherently sequential
• A new distributed depth-first-search algorithm
• Self-stabilizing depth-first search
• Distributed algorithms for depth-first search
• Corrigenda: Corrections to a distributed depth-first search algorithm
• Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation

This page was built for publication: Distributed algorithms for depth-first search