Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph.
Timothy ChuGary L. MillerDonald R. SheehyPublished in: SODA (2020)
Keyphrases
- shortest path
- geodesic distance
- exact computation
- weighted graph
- euclidean space
- finding the shortest path
- flow graph
- metric space
- manifold learning
- edge weights
- hilbert space
- path length
- betweenness centrality
- strongly connected components
- low dimensional
- shortest path algorithm
- distance measure
- euclidean distance
- markov chain monte carlo
- connected components
- vector space
- random walk
- directed acyclic graph
- distance metric
- approximate inference
- small world
- similarity search
- directed graph
- distance function
- graphical models