Login / Signup

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

Michael ElkinSeth Pettie
Published in: ACM Trans. Algorithms (2016)
Keyphrases
  • special case
  • database
  • neural network
  • closely related
  • memory requirements
  • graph theory
  • data analysis
  • maximal cliques
  • computational complexity
  • euclidean distance
  • finite dimensional
  • linear space