Finding the edge connectivity of directed graphs
Journal of Algorithms
A matroid approach to finding edge connectivity and packing arborescences
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Yet another optimal algorithm for 3-edge-connectivity
Journal of Discrete Algorithms
A simple algorithm for triconnectivity of a multigraph
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Algorithms and theory of computation handbook
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
Certifying 3-connectivity in linear time
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On identifying additive link metrics using linearly independent cycles and paths
IEEE/ACM Transactions on Networking (TON)
Efficiently computing k-edge connected components via graph decomposition
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
An overview of algorithms for network survivability
ISRN Communications and Networking
Decomposing a multigraph into split components
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
A simple 3-edge connected component algorithm revisited
Information Processing Letters
| Hi-index | 0.00 |
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.