Incremental DFS algorithms: a theoretical and experimental study

Abstract

The depth first search (DFS) tree is a fundamental data structure used for solving various graph problems. For a given graph G = (V, E) on n vertices and m edges, a DFS tree can be built in O(m + n) time. In the last 20 years, a few algorithms have been designed for maintaining a DFS tree efficiently under insertion of edges. For undirected graphs, there are two prominent algorithms, namely, ADFS1 and ADFS2 [ICALP14] that achieve total update time of O(n 3/2 √ m) and O(n 2 ) respectively. For directed acyclic graphs, the only non-trivial algorithm, namely, FDFS [IPL97] requires total O(mn) update time. However, even after 20 years of this result, there does not exist any non-trivial incremental algorithm for maintaining a DFS tree in directed graphs with o(m 2 ) worst case bound. In this paper, we carry out extensive experimental and theoretical evaluation of the existing incremental DFS algorithms in random graphs and real world graphs and derive the following results.1. For insertion of a uniformly random sequence of n 2 edges, each of ADFS1, ADFS2 and FDFS perform equally well and are found to take Θ(n 2 ) time experimentally. This is quite surprising because the worst case bounds of ADFS1 and FDFS are greater than Θ(n 2 ) by a factor of m/n and m/n respectively, which are also proven to be tight. We complement this experimental result with a probabilistic analysis of these algorithms establishingÕ(n 2 ) 1 bound on their time complexity. For this purpose, we derive results about the structure of a DFS tree in a random graph. These results are of independent interest in the domain of random graphs. 2. The insight that we developed about DFS tree in random graphs leads us to design an extremely simple algorithm for incremental DFS that works for both undirected and directed graphs. Moreover, this algorithm theoretically matches and experimentally outperforms the state-of-the-art algorithm in dense random graphs. Furthermore, it can also be used as a single-pass semi-streaming algorithm for computing incremental DFS and strong connectivity for random graphs using O(n log n) space. 3. Even for real world graphs, which are usually sparse, both ADFS1 and FDFS turn out to be much better than their theoretical bounds. Here again, we present two simple algorithms for incremental DFS for directed and undirected graphs respectively, which perform very well on real graphs. In fact our proposed algorithm for directed graphs almost always matches the performance of FDFS.

SciCap: Generating Captions for Scientific Figures

“…Intensive research will be needed to create models that can caption scientific figures reliably. [Figure sources: (1) (Zhang et al, 2020), (2)(Baswana et al, 2017), and (3)(Brubaker et al, 2015). ]…”

Space-Efficient Fully Dynamic DFS in Undirected Graphs †

“…Recently, Baswana et al [8] conducted an experimental study for the incremental (not fully dynamic) DFS problem. Besides this, Khan [9] proposed a parallel algorithm for the fully dynamic DFS (including vertex updates), which can compute the DFS tree after each update in O(log 3 n) time using m processors.…”

Fully dynamic depth-first search in directed graphs

“…Baswana and Choudhary [2] propose a randomized decremental algorithm to maintain a DFS-Tree under a sequence of edge deletions with expected O(mn log n) total time. Baswana et al [3] extend the incremental algorithm for directed acyclic graphs presented in [10] to general directed graphs.…”

“…Baswana et al [3] design an incremental algorithm to maintain a DFS-Tree in general directed graphs based on the algorithm presented in [10]. They make use of a structure called stick, which is a long downward path from the root on which there is no branching after a large number of edge insertions [3]. However, the stick structure may be broken due to the edge deletion.…”