5 citations · 5 across the 9 of their papers we have counts for
1 paper · 1 filter
Stoyan Dimitrov, Martin Minchev, Yan Zhuang
We find the average time complexity of the breadth-first search (BFS) and the depth-first search (DFS) algorithms, when one searches for a target node selected uniformly at random…