A self-stabilizing algorithm for 3-edge-connectivity

Authors:
Abusayeed M. Saifullah;Yung H. Tsin
Affiliations:
Computer and Inf. Science and Engineering, University of Florida, Gainesville, Florida;School of Computer Science, University of Windsor, Windsor, Ontario, Canada
Venue:
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Year:
2007

Citing 7
Cited 0

Self-stabilizing depth-first search

Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election

IEEE Transactions on Parallel and Distributed Systems
An O(n2) self-stabilizing algorithm for computing bridge-connected components

Computing
A self-stabilizing algorithm for detecting fundamental cycles in a graph

Journal of Computer and System Sciences
Self-stabilizing systems in spite of distributed control

Communications of the ACM
A stabilizing algorithm for finding biconnected components

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A self-stabilizing algorithm for bridge finding

Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The adoption of self-stabilization as an approach to fault-tolerant behavior has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 3-edge-connectivity of an asynchronous distributed model of computation. The self-stabilizing depth-first search algorithm of Collin and Dolev [4] is run concurrently to build a depth-first search spanning tree of the system. Once such a tree of height h is constructed, the detection of all 3-edge-connected components of the system requires O(h) rounds. The result of computation is kept in a distributed fashion in the sense that, upon stabilization of another phase of the algorithm, each processor knows all other processors that are 3-edge-connected to it. Until now, this is the only algorithm to compute all the 3-edge-connected components in the context of self-stabilization. Assuming that every processor requires m bits for the depth-first search algorithm, the space complexity of our algorithm is O(hm) bits per processor.