Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs (original) (raw)
Related papers
A simple algorithm for triconnectivity of a multigraph
2009
ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS
International Journal of Foundations of Computer Science, 2014
Linear time algorithms for graph search and connectivity determination on complement graphs
Information Processing Letters, 1998
Determining uni-connectivity in directed graphs
Information Processing Letters, 1993
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
Algorithmica, 2012
Determining 4-edge-connected components in linear time
2021
DEPTH-FIRST SEARCH AND LINEAR GRAPH ALGORITHMS
A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs
Information Processing Letters, 1993
2-Edge Connectivity in Directed Graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
The recognition of geodetically connected graphs
Information Processing Letters, 1998
A Depth-first Algorithm to Reduce Graphs in Linear Time
2009
Computing connected components of graphs
International Journal of Applied Mathematical Research, 2014
Brief announcement: speedups for parallel graph triconnectivity
2012
Engineering DFS-based graph algorithms
Good characterizations and linear time recognition for 2-probe block graphs
Discrete Applied Mathematics, 2017
Biconnectivity, chain decomposition and ststst-numbering using O(n)O(n)O(n) bits
ArXiv, 2016
On the Strongly Connected and Biconnected Components of the Complement of Graphs
Electronic Notes in Discrete Mathematics, 2004
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science, 2011
On Finding Minimal Two-Connected Subgraphs
1992
Bounded Arboricity to Determine the Local Structure of Sparse Graphs
Lecture Notes in Computer Science, 2006
Testing temporal connectivity in sparse dynamic graphs
Distributed 2-vertex connectivity test of graphs using local knowledge
In Proceeding of the International …, 2007
The Complexity of Finding Minimal Spanning Subgraphs
1991
A fully dynamic algorithm for the recognition of -sparse graphs
Theoretical Computer Science, 2012
On Finding Minimal 2-Connected Subgraphs
… of the second annual ACM-SIAM …, 1991
A divide-and-conquer algorithm for identifying strongly connectedcomponents
2003
On finding the strongly connected components in a directed graph
Information Processing Letters, 1994
A Note on the Recognition of Nested Graphs
2009
Characterizing and recognizing probe block graphs
Concurrent determination of connected components
Science of Computer Programming, 2001
Identifying sparse and dense sub-graphs in large graphs with a fast algorithm
EPL (Europhysics Letters), 2014
Recognizing connectedness from vertex-deleted subgraphs
Journal of Graph Theory, 2010
Computing Minimal Spanning Subgraphs In Linear Time
Proceedings of the third …, 1992
University of Groningen Concurrent determination of connected components
2017