A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
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 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 alldoi:10.1007/978-3-540-74742-0_4 fatcat:arpwobyzb5b3bb7ytw2wxdsdd4