Some remarks on distributed depth-first search.

DOI10.1016/S0020-0190(01)00273-3zbMath1044.68633OpenAlexW1991752483MaRDI QIDQ1853008

Yung Hyang Tsin

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00273-3

zbMATH Keywords

Distributed algorithmsAnalysis of algorithmsDepth-first searchCommunication network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (5)

On finding an ear decomposition of an undirected graph distributively ⋮ A note on the message complexity of Cidon's distributed depth-first search algorithm ⋮ Adaptive broadcast by fault-tolerant spanning tree switching ⋮ The DFS Fused Lasso: Linear-Time Denoising over General Graphs ⋮ AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

Cites Work

• Unnamed Item
• Depth-first search is inherently sequential
• A new distributed depth-first-search algorithm
• 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: Some remarks on distributed depth-first search.