5 citations · 5 across the 1 of their papers we have counts for
1 paper
Kurt Mehlhorn, Stefan Näher, Peter Sanders
Depth-first search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for the efficient implementation of DFS-based graph algorithms and exempl…