Reducing edge connectivity to vertex connectivity
ACM SIGACT News
Finding triconnected components by local replacement
SIAM Journal on Computing
Path-based depth-first search for strong and biconnected components
Information Processing Letters
Graph Algorithms
A Linear Time Implementation of SPQR-Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Simple 3-Edge-Connected Component Algorithm
Theory of Computing 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
| Hi-index | 0.00 |
A linear-time algorithm for decomposing a graph into split components is presented. The algorithm uses a new graph transformation technique to gradually transform the given graph so that every split component in it is transformed into a subgraph with very simple structure which can be easily identified. Once the split components are determined, the triconnected components of the graph are easily determined. The algorithm is conceptually simple and makes one less pass over the input graph than the existing best known algorithm which could mean substantial saving in actual execution time. The new graph transformation technique may be useful in other context.