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

DOI10.1016/J.IPL.2006.10.010MaRDI QIDQ845956zbMATH OpenOpenAlexFDO

Authors Yung H. 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

distributed computingdistributed algorithmfault tolerancebridgebiconnected componentcut-vertexself-stabilizing algorithmbridge-connected component

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• A self-stabilizing algorithm for bridge finding
• A self-stabilizing algorithm for constructing breadth-first trees
• A self-stabilizing algorithm for finding articulation points
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• A stabilizing algorithm for finding biconnected components
• An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
• Depth-First Search and Linear Graph Algorithms
• On finding an ear decomposition of an undirected graph distributively
• Parallel concepts in graph theory
• Self-stabilization
• Self-stabilizing depth-first search
• Self-stabilizing systems in spite of distributed control

Cited in

(1)

• Self-stabilizing computation of 3-edge-connected components

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845956)