Path-based depth-first search for strong and biconnected components
References (25)
- et al.
A linear-time algorithm for a special case of disjoint set union
J. Comput. System Sci.
(1985) A strong-connectivity algorithm and its application in data flow analysis
Comput. Math. Appl.
(1981)- et al.
The Design and Analysis of Computer Algorithms
(1974) - et al.
Data Structures and Algorithms
(1983) Hypergraphs: Combinatorics of Finite Sets
(1989)- et al.
Algorithmics: Theory & Practice
(1988) - et al.
Fundamentals of Algorithmics
(1996) - et al.
Introduction to Algorithms
(1990) Graph Algorithms
(1979)Path-based depth-first search for strong and biconnected components
(2000)
Dividing a graph into triconnected components
SIAM J. Comput.
Efficient planarity testing
J. ACM
Cited by (124)
A simple certifying algorithm for 3-edge-connectivity
2023, Theoretical Computer ScienceFinding strong components using depth-first search
2023, European Journal of CombinatoricsGraph-based modeling using association rule mining to detect influential users in social networks
2022, Expert Systems with ApplicationsCitation Excerpt :For a directed graph G = (V, E), we define an SCC as a subset Vs of V, where for every X ∈ Vs and Y ∈ V, if there exists a path from X to Y and a path from Y to X, then Y ∈ Vs. A path is a sequence of vertices, where if X and Y are two consecutive vertices in the path, then (X, Y) ∈ E. In the research literature, many algorithms have been proposed for the SCC-finding problem requiring linear time and based on the DFS algorithm (Gabow, 2000; Sharir, 1981). However, Tarjan’s algorithm (Tarjan, 1972) is considered to be one of the most efficient and requires a linear search time on the order of O(v + e), where v is the number of vertices and e is the number of edges in the input graph.
Finding strongly connected components of simple digraphs based on granulation strategy
2020, International Journal of Approximate ReasoningCitation Excerpt :Discovering SCCs knowledge of digraphs is one of crucial graph problems. The existing methods for finding SCCs are designed mostly based on two graph traversal algorithms, depth-first search (DFS) [11–13] and breadth-first search (BFS) [14,15]. However, traditional graph theory approaches focus on solving deterministic problem [16].
A Metrics Suite for Measuring Indirect Coupling Complexity
2023, Programming and Computer SoftwareOptimization Techniques for Model Checking Leads-to Properties in a Stratified Way
2023, ACM Transactions on Software Engineering and Methodology