A self-stabilizing algorithm for detecting fundamental cycles in a graph
From MaRDI portal
Recommendations
- A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
- Distributed processing of graphs: Fundamental cycles algorithm
- An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
- Self-stabilizing computation of 3-edge-connected components
- A self-stabilizing algorithm for bridge finding
Cites work
- scientific article; zbMATH DE number 3752234 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- A note on finding the bridges of a graph
- A self-stabilizing algorithm for coloring bipartite graphs
- A self-stabilizing algorithm for constructing breadth-first trees
- A self-stabilizing algorithm for strong fairness
- A self-stabilizing algorithm for the maximum flow problem
- An efficient distributed bridge-finding algorithm
- Distributed processing of graphs: Fundamental cycles algorithm
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Self-stabilizing depth-first search
- Self-stabilizing systems in spite of distributed control
- Stabilizing unison
Cited in
(6)- A self-stabilizing graph algorithm: Finding the cutting center of a tree
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks
- Self-stabilizing computation of 3-edge-connected components
- Distributed processing of graphs: Fundamental cycles algorithm
- A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
- A self-stabilizing algorithm for the st-order problem
This page was built for publication: A self-stabilizing algorithm for detecting fundamental cycles in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807676)
