A self-stabilizing algorithm for detecting fundamental cycles in a graph
From MaRDI portal
Publication:1807676
DOI10.1006/JCSS.1999.1622zbMath0939.68094OpenAlexW2073448902MaRDI QIDQ1807676
Publication date: 23 November 1999
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1999.1622
Related Items (5)
SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS ⋮ A self-stabilizing algorithm for the st-order problem ⋮ Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks ⋮ A self-stabilizing graph algorithm: Finding the cutting center of a tree ⋮ A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
Cites Work
- Unnamed Item
- Unnamed Item
- Stabilizing unison
- Distributed processing of graphs: Fundamental cycles algorithm
- A self-stabilizing algorithm for constructing breadth-first trees
- Self-stabilizing depth-first search
- A self-stabilizing algorithm for strong fairness
- A self-stabilizing algorithm for coloring bipartite graphs
- A note on finding the bridges of a graph
- An efficient distributed bridge-finding algorithm
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Self-stabilizing systems in spite of distributed control
- A self-stabilizing algorithm for the maximum flow problem
This page was built for publication: A self-stabilizing algorithm for detecting fundamental cycles in a graph
