An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity

DOI10.1016/J.IPL.2006.10.010zbMath1184.68618OpenAlexW2049413965MaRDI QIDQ845956

Yung Hyang Tsin

Publication date: 29 January 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.10.010

zbMATH Keywords

fault tolerancedistributed computingdistributed algorithmbridgebiconnected componentcut-vertexself-stabilizing algorithmbridge-connected component

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (1)

SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stabilizing algorithm for finding biconnected components
• A self-stabilizing algorithm for constructing breadth-first trees
• An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
• Self-stabilizing depth-first search
• Parallel concepts in graph theory
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• On finding an ear decomposition of an undirected graph distributively
• Self-stabilizing systems in spite of distributed control
• A SELF-STABILIZING ALGORITHM FOR FINDING ARTICULATION POINTS
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity