3 citations · 3 across the 2 of their papers we have counts for
1 paper · 1 filter
David Eppstein, Michael T. Goodrich, James A. Liu +1
We consider the NP-complete problem of tracking paths in a graph, first introduced by Banik et. al. [3]. Given an undirected graph with a source s and a destination t, find the…