SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS

DOI10.1142/S0129054111008623zbMath1311.68032OpenAlexW1967301683MaRDI QIDQ3173942

Abusayeed Saifullah, Yung Hyang Tsin

Publication date: 10 October 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111008623

zbMATH Keywords

fault-tolerancedistributed systemself-stabilizationdepth-first search tree3-edge-connected componentcut-pair

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A stabilizing algorithm for finding biconnected components
• An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity
• A belated proof of self-stabilization
• An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
• A self-stabilizing distributed algorithm to find the median of a tree graph
• A self-stabilizing algorithm for coloring planar graphs
• Self-stabilizing depth-first search
• A self-stabilizing algorithm for detecting fundamental cycles in a graph
• Self-stabilizing systems in spite of distributed control
• A SELF-STABILIZING ALGORITHM FOR FINDING ARTICULATION POINTS
• AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS