A Simple 3-Edge-Connected Component Algorithm

Authors:
Yung H. Tsin
Affiliations:
School of Computer Science, University of Windsor, Windsor, Ontario, N9B 3P4, Canada
Venue:
Theory of Computing Systems
Year:
2007

Citing 0
Cited 9

Yet another optimal algorithm for 3-edge-connectivity

Journal of Discrete Algorithms
Algorithms for Placing Monitors in a Flow Network

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
A simple algorithm for triconnectivity of a multigraph

CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Fast computation of small cuts via cycle space sampling

ACM Transactions on Algorithms (TALG)
Cactus graphs for genome comparisons

RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
A novel layout decomposition algorithm for triple patterning lithography

Proceedings of the 49th Annual Design Automation Conference
An efficient layout decomposition approach for triple patterning lithography

Proceedings of the 50th Annual Design Automation Conference
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple linear-time algorithm for finding all the 3-edge-connected components of an undirected graph is presented. The algorithm performs only one depth-first search over the given graph. Previously best known algorithms perform multiple depth-first searches in multiple phases.