Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs
From MaRDI portal
Publication:3060789
DOI10.1007/978-3-642-17514-5_32zbMath1310.68160OpenAlexW1491488300MaRDI QIDQ3060789
Publication date: 9 December 2010
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_32
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (2)
Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Frameworks for designing in-place graph algorithms
This page was built for publication: Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs
