Login / Signup

Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs.

Qian-Ping GuGengchun Xu
Published in: ISAAC (2015)
Keyphrases
  • planar graphs
  • query processing
  • distance function
  • high dimensional
  • distance measure
  • optimal solution
  • lower bound
  • linear program