A Simple Test on 2-Vertex- and 2-Edge-Connectivity
Data Structures and Algorithms
2012-09-05 v1 Discrete Mathematics
Combinatorics
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.
Cite
@article{arxiv.1209.0700,
title = {A Simple Test on 2-Vertex- and 2-Edge-Connectivity},
author = {Jens M. Schmidt},
journal= {arXiv preprint arXiv:1209.0700},
year = {2012}
}