Engineering DFS-based graph algorithms (original) (raw)
Related papers
DEPTH-FIRST SEARCH AND LINEAR GRAPH ALGORITHMS
A divide-and-conquer algorithm for identifying strongly connectedcomponents
2003
Heuristics for semi-external depth first search on directed graphs
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02, 2002
Finding strongly connected components in distributed graphs
A Depth-first Algorithm to Reduce Graphs in Linear Time
2009
On Finding the Strong Components in a Directed Graph
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs
Lecture Notes in Computer Science, 2010
On finding the strongly connected components in a directed graph
Information Processing Letters, 1994
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Foundations of Computer Science, 1984
A new parallel algorithm for connected components in dynamic graphs
20th Annual International Conference on High Performance Computing, 2013
Analysis of the Depth First Search Algorithms
SpringerReference
Theory and Techniques for Synthesizing a Family of Graph Algorithms
Electronic Proceedings in Theoretical Computer Science, 2012
Computing connected components of graphs
International Journal of Applied Mathematical Research, 2014
Building the Component Tree in Quasi-Linear Time
IEEE Transactions on Image Processing, 2000
A simple and practical linear-work parallel algorithm for connectivity
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014
Space-Efficient Implementations of Graph Search Methods
ACM Transactions on Mathematical Software, 1983
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, 2015
Space-efficient basic graph algorithms
DSP-CC: I/O Efficient Parallel Computation of Connected Components in Billion-scale Networks
IEEE Transactions on Knowledge and Data Engineering, 2015
DYNAMIC DFS IN UNDIRECTED GRAPHS: BREAKING THE \bfitO (\bfitm ) BARRIER\ast
2019
Determining 4-edge-connected components in linear time
2021
Quasilinear algorithm for the component tree
2004
Linear time algorithms for graph search and connectivity determination on complement graphs
Information Processing Letters, 1998
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP
Algorithmica, 2002
Improved Space Efficient Algorithms for BFS, DFS and Applications
Lecture Notes in Computer Science, 2016
Dynamic DFS Tree in Undirected Graphs: breaking the $ O (m) $ barrier
Graph algorithms on a tree-structured parallel computer
BIT, 1984
On the architectural requirements for efficient execution of graph algorithms
A Simple Algorithm for Finding All k-Edge-Connected Components
PloS one, 2015
Efficient trimming for strongly connected components calculation
2022