In this paper, we present a silent algorithm for finding cut-nodes and bridges in arbitrary rooted networks. This algorithm must be composed with an algorithm from Collin and Dolev. This latter algorithm is also silent and computes a Depth First Search ( ) Spanning Tree of the network. The composition of these two algorithms is self-stabilizing: starting from any arbitrary configuration, it requires a finite number of steps to converge to a legitimate configuration and the system state remains legimate thereafter. The memory requirement of this composite algorithm is
The algorithm in REF computes cut-nodes and bridges on connected graph endowed with a depthfirst spanning tree.
A silent self-stabilizing algorithm for finding cut-nodes and bridges
Parallel Processing Letters
Computer Science