Distributed 2-Vertex Connectivity Test of Graphs Using Local Knowledge

@inproceedings{Hamid2007Distributed2C,
  title={Distributed 2-Vertex Connectivity Test of Graphs Using Local Knowledge},
  author={Brahim Hamid and Bertrand Le Sa{\"e}c and Mohamed Mosbah},
  year={2007}
}
The vertex connectivity of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. This work is devoted to the problem of vertex connectivity test of graphs in a distributed environment based on a general and a constructive approach. The contribution of this paper is threefold. First, using a pre-constructed spanning tree of the considered graph, we present a protocol to test whether a given graph is 2-connected using only local knowledge. Second, we… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.

Weak consistency vs . access control : Distributed path maintenance Erwan Le Merrer Technicolor

Gilles Straub Technicolor
  • 2010
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

Introduction to Graph Theory

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Introduction to Distributed Algorithms

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Proving distributed algorithms by graph relabeling systems: Example of tree in networks with processor identities

Y. Métivier, M. Mosbah, A. Sellami
  • In applied Graph Transformations (AGT2002),
  • 2002
VIEW 1 EXCERPT

Using expander graphs to find vertex connectivity

  • Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
VIEW 1 EXCERPT