Distributed algorithms for depth-first search
From MaRDI portal
Recommendations
Cites work
- 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
- Self-stabilizing depth-first search
Cited in
(13)- A distributed algorithm for computing the node search number in trees
- Message and time efficient multi-broadcast schemes
- Some remarks on distributed depth-first search.
- Conflict-free broadcasting algorithms for graph traversals and their applications
- scientific article; zbMATH DE number 3999275 (Why is no real title available?)
- Distributed algorithms for depth-first search
- Space efficient and time optimal distributed BFS tree construction
- Finite-time average consensus based approach for distributed convex optimization
- Self-stabilizing depth-first search
- A new distributed depth-first-search algorithm
- A note on the message complexity of Cidon's distributed depth-first search algorithm
- Fast distributed DFS solutions for edge-disjoint paths in digraphs
- scientific article; zbMATH DE number 2036580 (Why is no real title available?)
This page was built for publication: Distributed algorithms for depth-first search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349993)