Faster Approximation of Distances in Graphs.
Piotr BermanShiva Prasad KasiviswanathanPublished in: WADS (2007)
Keyphrases
- graph matching
- error bounds
- approximation algorithms
- graph theoretic
- graph model
- relative error
- highly efficient
- weighted graph
- closed form
- euclidean distance
- distance measure
- directed graph
- approximation ratio
- graph representation
- approximation methods
- adjacency matrix
- series parallel
- pattern recognition
- approximation error
- approximation schemes
- random graphs
- graph clustering
- dimensionality reduction
- semi supervised
- pairwise
- feature space