A simple test on 2-vertex- and 2-edge-connectivity

Authors:
Jens M. Schmidt
Affiliations:
Max Planck Institute for Informatics, Germany
Venue:
Information Processing Letters
Year:
2013

Citing 4
Cited 0

Path-based depth-first search for strong and biconnected components

Information Processing Letters
Eager st-Ordering

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On finding an ear decomposition of an undirected graph distributively

Information Processing Letters
Graph Theory

Graph Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

Testing a graph on 2-vertex- and 2-edge-connectivity are two fundamental algorithmic graph problems. For both problems, different linear-time algorithms with simple implementations are known. Here, an even simpler linear-time algorithm is presented that computes a structure from which both the 2-vertex- and 2-edge-connectivity of a graph can be easily ''read off@?''. The algorithm computes all bridges and cut vertices of the input graph in the same time.