Reducing edge connectivity to vertex connectivity
Zvi Galil, Giuseppe Francesco Italiano · ACM SIGACT News · 1991
We show how to reduce edge connectivity to vertex connectivity. Using this reduction, we obtain a linear-time algorithm for deciding whether an undirected graph is 3-edge-connected, and for computing the 3-edge-connected components of an undirected graph.