2 citations · 2 across the 1 of their papers we have counts for
1 paper
David Burstein, Leigh Metcalf
Due to the computational complexity of finding almost shortest simple paths, we propose that identifying a larger collection of (nonbacktracking) paths is more efficient than findi…