A stabilizing algorithm for finding biconnected components
From MaRDI portal
Publication:701154
DOI10.1006/JPDC.2001.1833zbMATH Open1004.68020OpenAlexW1965251111MaRDI QIDQ701154FDOQ701154
Authors: Mehmet Hakan Karaata 
Publication date: 16 October 2002
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/edb42f2afb385f6a83f599d33544c10b91d6d469
Recommendations
- A self-stabilizing algorithm for bridge finding
- A self-stabilizing algorithm for finding articulation points
- An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
- A dynamic self-stabilizing algorithm for constructing a transport net
- Self-stabilizing computation of 3-edge-connected components
Cited In (14)
- An optimal self-stabilizing strarvation-free alternator
- An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity
- An efficient fault-containing self-stabilizing algorithm for the shortest path problem
- An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
- A self-stabilizing and local Delaunay graph construction
- A dynamic self-stabilizing algorithm for constructing a transport net
- Path-based depth-first search for strong and biconnected components
- A self-stabilizing algorithm for the maximum flow problem
- Self stabilization in distributed knot detection
- A self-stabilizing algorithm for finding articulation points
- A self-stabilizing algorithm for bridge finding
- A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets
- Self-stabilizing computation of 3-edge-connected components
- Concurrent determination of connected components
This page was built for publication: A stabilizing algorithm for finding biconnected components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701154)
