@inproceedings{cda7713b1566418e849b267fd62be9a7,

title = "On dynamic DFS tree in directed graphs",

abstract = "Let G = (V,E) be a directed graph on n vertices and m edges. We address the problem of maintaining a depth first search (DFS) tree efficiently under insertion/deletion of edges in G. 1. We present an efficient randomized decremental algorithm for maintaining a DFS tree for a directed acyclic graph. For processing any arbitrary online sequence of edge deletions, this algorithm takes expected O(mnlog n) time. 2. We present the following lower bound results. (a) Any decremental (or incremental) algorithm for maintaining the ordered DFS tree explicitly requires Ω(mn) total update time in the worst case. (b) Any decremental (or incremental) algorithm for maintaining the ordered DFS tree is at least as hard as computing all-pairs reachability in a directed graph.",

keywords = "Decremental, Depth first search, Directed, Dynamic, Graph",

author = "Surender Baswana and Keerti Choudhary",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2015.; 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015 ; Conference date: 24-08-2015 Through 28-08-2015",

year = "2015",

doi = "10.1007/978-3-662-48054-0_9",

language = "אנגלית",

isbn = "9783662480533",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "102--114",

editor = "Italiano, {Giuseppe F.} and Giovanni Pighizzini and Sannella, {Donald T.}",

booktitle = "Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Proceedings",

}