A stabilizing algorithm for finding biconnected components

Authors:
Mehmet Hakan Karaata
Affiliations:
Department of Computer Engineering, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait
Venue:
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Year:
2002

Citing 20
Cited 5

Uniform self-stabilizing rings

ACM Transactions on Programming Languages and Systems (TOPLAS)
Token Systems That Self-Stabilize

IEEE Transactions on Computers
How to find biconnected components in distributed networks

Journal of Parallel and Distributed Computing
Computing biconnected on a hypercube

The Journal of Supercomputing
Distributed program checking: a paradigm for building self-stabilizing distributed protocols (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A self-stabilizing algorithm for constructing breadth-first trees

Information Processing Letters
Self-stabilization

ACM Computing Surveys (CSUR)
Why should biconnected components be identified first

Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Leader election in uniform rings

ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

SIAM Journal on Computing
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Computer Algorithms: Introduction to Design and Analysis

Computer Algorithms: Introduction to Design and Analysis
Distributed Reset

IEEE Transactions on Computers
An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous Networks

Proceedings of the Ninth Conference on Foundations of Software Technology and Theoretical Computer Science
Time Optimal Self-Stabilizing Spanning Tree Algorithms

Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Superstabilizing Protocols for Dynamic Distributed Systems

Superstabilizing Protocols for Dynamic Distributed Systems
A self-stabilizing algorithm for bridge finding

Distributed Computing
Self-stabilization of dynamic systems assuming only read/write atomicity

Distributed Computing - Special issue: Self-stabilization
Self-stabilizing extensions for message-passing systems

Distributed Computing - Special issue: Self-stabilization
A self-stabilizing algorithm for coloring planar graphs

Distributed Computing - Special issue: Self-stabilization

An optimal self-stabilizing strarvation-free alternator

Journal of Computer and System Sciences
An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity

Information Processing Letters
A self-stabilising algorithm for 3-edge-connectivity

International Journal of High Performance Computing and Networking
An application of snap-stabilization: matching in bipartite graphs

ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
A self-stabilizing algorithm for 3-edge-connectivity

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a self-stabilizing algorithm is presented for finding biconnected components of a connected undirected graph on a distributed or network model of computation. The algorithm is resilient to transient faults, therefore, it does not require initialization. The proposed algorithm is based on stabilizing BFS construction and bridge-finding algorithms. Upon termination of these algorithms, the proposed algorithm terminates after O(d) rounds, where d is the diameter of the biconnected component with the largest diameter in the graph. The paper concludes with remarks on issues such as the adaptiveness of the algorithm.