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

Publikationstyp
Journal Article
Date Issued
2013-01-23
Sprache
English
Author(s)
Schmidt, Jens M.  orcid-logo
TORE-URI
http://hdl.handle.net/11420/7622
Journal
Information processing letters  
Volume
113
Issue
7
Start Page
241
End Page
244
Citation
Information Processing Letters (2013)
Publisher DOI
10.1016/j.ipl.2013.01.016
Scopus ID
2-s2.0-84873293914
Publisher
Elsevier
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.
Subjects
2-connectivity
2-edge-connectivity
Graph algorithms
DDC Class
510: Mathematik