Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Chowdary, Madamanchi Ashok"'
Autor:
Bhagavan, Kancharla Nikhilesh, Vardhan, Macharla Sri, Chowdary, Madamanchi Ashok, Khan, Shahbaz
Depth first search is a fundamental graph problem having a wide range of applications. For a graph $G=(V,E)$ having $n$ vertices and $m$ edges, the DFS tree can be computed in $O(m+n)$ using $O(m)$ space where $m=O(n^2)$. In the streaming environment
Externí odkaz:
http://arxiv.org/abs/2406.03922
