A self-stabilizing algorithm for bridge finding

Authors:
Mehmet Hakan Karaata;Pranay Chaudhuri
Affiliations:
Department of Electrical and Computer Engineering, Kuwait University, P.O. Box 5969 Safat-13060 Kuwait;Department of Electrical and Computer Engineering, Kuwait University, P.O. Box 5969 Safat-13060 Kuwait
Venue:
Distributed Computing
Year:
1999

Citing 14
Cited 7

Efficient parallel algorithms for a class of graph theoretic problems

SIAM Journal on Computing
Uniform self-stabilizing rings

ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic self-stabilization

Information Processing Letters
Self-stabilizing extensions for message-passing systems

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Self-stabilization of dynamic systems assuming only read/write atomicity

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Token management schemes and random walks yield self-stabilizing mutual exclusion

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
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
Parallel algorithms: design and analysis

Parallel algorithms: design and analysis
A self-stabilizing algorithm for constructing breadth-first trees

Information Processing Letters
Self-stabilization

ACM Computing Surveys (CSUR)
Leader election in uniform rings

ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient distributed bridge-finding algorithm

Information Sciences—Informatics and Computer Science: An International Journal
Sorting Using Networks of Queues and Stacks

Journal of the ACM (JACM)
A self-stabilizing algorithm for coloring planar graphs

Distributed Computing - Special issue: Self-stabilization

A stabilizing algorithm for finding biconnected components

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity

Information Processing Letters
A self-stabilizing algorithm for the st-order problem

International Journal of Parallel, Emergent and Distributed Systems
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
The Worst-Case Stabilization Time of a Self-Stabilizing Algorithm under the Weakly Fair Daemon Model

International Journal of Artificial Life Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A self-stabilizing algorithm is presented in this paper that finds the bridges of a connected undirected graph on a distributed or network model of computation after O(|E|n2) moves. The algorithm is resilient to transient faults and does not require initialization. In addition, a correctness proof of the algorithm is provided. The paper concludes with remarks on the time complexity of the algorithm.