3 citations · 3 across the 3 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DM2019
Tracking Paths in Planar Graphs
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 and a destination , find the…
cs.CG2019
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains
Nil Mamano, Alon Efrat, David Eppstein +5
We show new applications of the nearest-neighbor chain algorithm, a technique that originated in agglomerative hierarchical clustering. We apply it to a diverse class of geometric…