2-Edge-Connectivity and 2-Vertex-Connectivity with Fault Containment

Authors

Abusayeed Saifullah, Washington University in St Louis

Document Type

Technical Report

Department

Computer Science and Engineering

Publication Date

2011

Filename

WUCSE-2011-96.pdf

Technical Report Number

WUCSE-2011-96

Abstract

Self-stabilization for non-masking fault-tolerant distributed system has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 2-edge-connectivity and 2-vertex-connectivity of an asynchronous distributed computer network. It is based on a self-stabilizing depth-first search, and is not a composite algorithm in the sense that it is not composed of a number of self-stabilizing algorithms that run concurrently. The time and space complexities of the algorithm are the same as those of the underlying self-stabilizing depth-first search algorithm.

Comments

Permanent URL: http://dx.doi.org/10.7936/K75H7DH9

Recommended Citation

Saifullah, Abusayeed, " 2-Edge-Connectivity and 2-Vertex-Connectivity with Fault Containment" Report Number: WUCSE-2011-96 (2011). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/71