Improved algorithms for graph four-connectivity
Journal of Computer and System Sciences
Reducing edge connectivity to vertex connectivity
ACM SIGACT News
Path-based depth-first search for strong and biconnected components
Information Processing Letters
A Simple 3-Edge-Connected Component Algorithm
Theory of Computing Systems
Determining edge connectivity in 0(nm)
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A simple algorithm for triconnectivity of a multigraph
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Spare capacity allocation using shared backup path protection for dual link failures
Computer Communications
Efficiently computing k-edge connected components via graph decomposition
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
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 |
An optimal algorithm for 3-edge-connectivity is presented. The algorithm performs only one pass over the given graph to determine a set of cut-pairs whose removal leads to the 3-edge-connected components. An additional pass determines all the 3-edge-connected components of the given graph. The algorithm is simple, easy to implement and runs in linear time and space. Experimental results show that it outperforms all the previously known linear-time algorithms for 3-edge-connectivity in determining if a given graph is 3-edge-connected and in determining cut-pairs. Its performance is also among the best in determining the 3-edge-connected components.