Finding the Vertex Connectivity of Graphs

  title={Finding the Vertex Connectivity of Graphs},
  author={Zvi Galil},
  journal={SIAM J. Comput.},
New implementation of known algorithms improve the running time of the best known algorithms for finding the vertex connectivity of undirected and directed graphs. Let G be a finite undirected graph, with no self-loops and no parallel edges with set of vertices V and set of edges E. A set of vertices, $, is called an (a, b) vertex separator if {a, b} _ VS and every path connecting a and b passes through at least one vertex of $. Clearly, if a and b are connected by an edge, no (a, b) vertex… CONTINUE READING
Highly Cited
This paper has 52 citations. REVIEW CITATIONS



Citations per Year

53 Citations

Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.