.png){kind=icon}
Return
A stabilizing algorithm for finding biconnected components
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.2001.1833.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2002 Elsevier Science (USA).
Keywords:
biconnected components
distributed systems
fault-tolerance
self-stabilization
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
Use of cross correlation in studying the response of lightly damped structures to random forces..png)
AIAA Journal
AIAA JournalIF0
PREAI
ShareSave
ShareSaveShareSave
View more