A Silent Self-stabilizing Algorithm for Finding Cut-nodes and Bridges

@article{Devismes2005ASS,
  title={A Silent Self-stabilizing Algorithm for Finding Cut-nodes and Bridges},
  author={St{\'e}phane Devismes},
  journal={Parallel Process. Lett.},
  year={2005},
  volume={15},
  pages={183-198}
}
In this paper, we present a self-stabilizing algorithm for finding cut-nodes and bridges in arbitrary rooted networks with a low memory requirement (O(log(n)) bits per processor where n is the number of processors). Our algorithm is silent and must be composed with a silent self-stabilizing algorithm computing a Depth-First Search (DFS) Spanning Tree of the network. So, in the paper, we will prove that the composition of our algorithm with any silent self-stabilizing DFS algorithm is self… 

Figures from this paper

A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm

This paper presents a silent stabilizing algorithm working in n2 steps with a distributed daemon, without any fairness assumptions, which improves all the previous results of the literature.

A Self-stabilizing Algorithm For 3-Edge-Connectivity

This paper proposes a self-stabilizing algorithm for 3-edge-connectivity of an asynchronous distributed model of computation that can be run concurrently to build a depth-first search spanning tree of the system.

Self-Stabilizing Computation of 3-Edge-Connected Components

The algorithm is designed in such a way that its time complexity is dominated by that of the self-stabilizing depth-first search spanning tree construction in the sense that any improvement made in the latter automatically implies improvement in the time complexity of the algorithm.

A self-stabilising algorithm for 3-edge-connectivity

A self-stabilising algorithm for 3-edge-connectivity of an asynchronous distributed model of computation with space complexity O(n² log Δ) bits per processor, where Δ is an upper bound on the degree of a processor.

2-Edge-Connectivity and 2-Vertex-Connectivity of an Asynchronous Distributed Network

This paper proposes a self-stabilizing algorithm for 2-edge-connectivity and 2-vertex-Connectivity of an asynchronous distributed computer network that is based on aSelf-Stabilizing depth-first search.

An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity

Acyclic Strategy for Silent Self-Stabilization in Spanning Forests

It is shown that any algorithm of this class is silent and self-stabilizing under the distributed unfair daemon, and has a stabilization time polynomial in moves and asymptotically optimal in rounds.

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

A self-stabilizing algorithm for 2-edge-Connectivity and 2-vertex-connectivity of an asynchronous distributed computer network 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.

Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs

A Self-Stabilizing Algorithm for Constructing ST-Reachable Directed Acyclic Graph When lS| ≤ 2 and |T| ≤ 2

The necessary and sufficient condition that a minimal ST-reachable DAG can be constructed when S ≤ 2 and |T| ≤ 2 is presented, and a self-stabilizing algorithm to construct an ST-reaching DAG (if exists) when an arbitrary connected undirected graph, S and T are given is proposed.

References

SHOWING 1-10 OF 16 REFERENCES

A self-stabilizing algorithm for bridge finding

Summary. A self-stabilizing algorithm is presented in this paper that finds the bridges of a connected undirected graph on a distributed or network model of computation after $O(\vert E\vert n^2)$

Self-Stabilizing Depth-First Search

Efficient distributed algorithms solving problems about the connectivity of network

This paper presents efficient distributed algorithms on an asynchronous network for the following problems: finding bi-connected components, finding cutpoints, finding bridges, testing for

An $O(n^2)$ Self-Stabilizing Algorithm for Computing Bridge-Connected Components

Abstract.This paper presents a self-stabilizing algorithm that finds the bridge-connected components of a connected undirected graph on an asynchronous distributed or network model of computation. An

Self-stabilization with r-operators

A parameterized distributed algorithm applicable to any directed graph topology instantiated to produce distributed algorithms for both fundamental and high level applications, such as shortest path calculus and depth-first-search tree construction that can be useful for a large class of distributed systems.

Depth-First Search and Linear Graph Algorithms

The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components

Uniform Dynamic Self-Stabilizing Leader Election

This work introduces self-stabilizing protocols for synchronization that are used as building blocks by the leader-election algorithm and presents a simple, uniform, self-Stabilizing ranking protocol.

A Self-Stabilizing Algorithm for Finding Articulation Points

  • M. Karaata
  • Computer Science
    Int. J. Found. Comput. Sci.
  • 1999
In this paper, a self-stabilizing algorithm is presented for finding the articulation points of a connected undirected graph on a distributed or network model of computation after O(n2|E|) moves. The

An algorithm for the blocks and cutnodes of a graph

An efficient method is presented for finding blocks and cutnodes of an arbitrary undirected graph using a packed adjacency matrix generated by an extension of the web grammar approach.

A note on self-stabilizing articulation point detection