Depth First Search (DFS) tree is a fundamental data structure for graphs used in solving various algorithmic problems. However, very few results are known for maintaining DFS tree in a dynamic environment - insertion or deletion of edges. The only non-trivial result for this problem is by Franciosa et al. [4]. They showed that, for a directed acyclic graph on n vertices, a DFS tree can be maintained in O(n) amortized time per edge insertion. They stated it as an open problem to maintain a DFS tree dynamically in an undirected graph or general directed graph. We present the first algorithm for maintaining a DFS tree for an undirected graph under insertion of edges. For processing any arbitrary online sequence of edge insertions, this algorithm takes total O(n2) time. © 2014 Springer-Verlag.
CITATION STYLE
Baswana, S., & Khan, S. (2014). Incremental algorithm for maintaining DFS tree for undirected graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8572 LNCS, pp. 138–149). Springer Verlag. https://doi.org/10.1007/978-3-662-43948-7_12
Mendeley helps you to discover research relevant for your work.