A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs.

Michael Elkin Seth Pettie

Published in: CoRR (2015)

Keyphrases

special case
data analysis
closely related
linear space
graph matching
graph theory
memory requirements
maximal cliques
finite dimensional
random graphs
path length
graph mining
data mining
distance metric
euclidean distance
shortest path
computational complexity