A self-stabilising algorithm for 3-edge-connectivity Online publication date: Sat, 21-Mar-2015
by Abusayeed M. Saifullah, Yung H. Tsin
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 7, No. 1, 2011
Abstract: Self-stabilisation is a theoretical framework for fault-tolerance without external assistance. Adoption of self-stabilisation in distributed systems has received considerable research interest over the last decade. In this paper, we propose a self-stabilising algorithm for 3-edge-connectivity of an asynchronous distributed model of computation. A self-stabilising depth-first search algorithm is run concurrently to build a depth-first search spanning tree of the system. Once such a tree is constructed, all the 3-edge-connected components of the system can be detected in O(h) rounds, where h is the height of the depth-first search tree. The result of computation is kept in a distributed fashion in the sense that, upon stabilisation of the algorithm, each processor knows all other processors that are 3-edge-connected to it. The space complexity of our algorithm is O(n² log Δ) bits per processor, where Δ is an upper bound on the degree of a processor.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook