Self-stabilizing depth-first search

DOI10.1016/0020-0190(94)90103-1zbMath0803.68041OpenAlexW2084577435MaRDI QIDQ1321819

Zeev Collin, Shlomi Dolev

Publication date: 3 May 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90103-1

zbMATH Keywords

fault tolerancedistributed computingdepth-first searchdistributed algorithmspanning tree algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (27)

SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE ⋮ A self-stabilizing Hashed Patricia Trie ⋮ SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS ⋮ An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity ⋮ Distributed algorithms for depth-first search ⋮ A self-stabilizing algorithm for strong fairness ⋮ A self-stabilizing algorithm for the st-order problem ⋮ Compact routing messages in self-healing trees ⋮ Analysis of a memory-efficient self-stabilizing BFS spanning tree construction ⋮ A self-stabilizing algorithm for the maximum flow problem ⋮ Self-stabilizing depth-first token circulation in arbitrary rooted networks ⋮ Adopt: asynchronous distributed constraint optimization with quality guarantees ⋮ Adaptive broadcast by fault-tolerant spanning tree switching ⋮ Maximum metric spanning tree made Byzantine tolerant ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS ⋮ Self-stabilizing silent disjunction in an anonymous network ⋮ Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks ⋮ The first fully polynomial stabilizing algorithm for BFS tree construction ⋮ A self-stabilizing algorithm for detecting fundamental cycles in a graph ⋮ A self-stabilizing graph algorithm: Finding the cutting center of a tree ⋮ Quasi-self-stabilization of a distributed system assuming read/write atomicity ⋮ Optimized silent self-stabilizing scheme for tree-based constructions ⋮ A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given ⋮ A self-stabilizing distributed algorithm to find the median of a tree graph ⋮ A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH ⋮ SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM

Cites Work

• A new distributed depth-first-search algorithm
• Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
• Self-stabilizing systems in spite of distributed control
• Resource bounds for self stabilizing message driven protocols
• The mutual exclusion problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Self-stabilizing depth-first search