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

2013/01/23 by Jens M. Schmidt · 1 citation
Computer Science · Mathematics · #Algorithm #Biconnected graph #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Distributed systems and fault tolerance #Graph #Graph algorithms #Interconnection Networks and Systems #Line graph #Mathematics #Time complexity #Vertex (graph theory) #Voltage graph

paper · doi:10.1016/j.ipl.2013.01.016

openalex publication_date 2013/01/23 · crossref created 2013/01/23 · crossref issued 2013/04/01 · crossref published 2013/04/01 · crossref published-print 2013/04/01 · crossref deposited 2023/06/28 · openalex created_date 2025/10/10 · crossref indexed 2026/07/02 · openalex updated_date 2026/07/28

Citations

• Zur allgemeinen Kurventheorie
• Algorithms for dense graphs and networks on the random access computer
• Depth-First Search and Linear Graph Algorithms
• A note on finding the bridges of a graph
• Non-separable and planar graphs

Cited by

• Biconnected component [wikipedia]