Depth First Search in the Semi-streaming Model

Shahbaz Khan, Shashank K. Mehta

Depth first search (DFS) tree is a fundamental data structure for solving various graph problems. The classical DFS algorithm requires $O(m+n)$ time for a graph having $n$ vertices…