An Improved Algorithm for Incremental DFS Tree in Undirected Graphs

Lijie Chen, Ran Duan, Ruosong Wang +2

Depth first search (DFS) tree is one of the most well-known data structures for designing efficient graph algorithms. Given an undirected graph $G=(V,E)$ with $n$ vertices and $m$…