Some remarks on distributed depth-first search.

DOI10.1016/S0020-0190(01)00273-3MaRDI QIDQ1853008zbMATH OpenOpenAlexFDO

Authors Yung H. 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

Analysis of algorithmsDepth-first searchDistributed algorithmsCommunication network

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 732976 (Why is no real title available?)
• A new distributed depth-first-search algorithm
• Corrigenda: Corrections to a distributed depth-first search algorithm
• Depth-first search is inherently sequential
• Distributed algorithms for depth-first search
• Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation

Cited in

(5)

• The DFS fused Lasso: linear-time denoising over general graphs
• AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY
• A note on the message complexity of Cidon's distributed depth-first search algorithm
• On finding an ear decomposition of an undirected graph distributively
• Adaptive broadcast by fault-tolerant spanning tree switching

This page was built for publication: Some remarks on distributed depth-first search.

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