Constant Query Time $(1 + ε)$-Approximate Distance Oracle for Planar Graphs.

Qian-Ping Gu Gengchun Xu

Published in: CoRR (2017)

Keyphrases

planar graphs
lower bound

query processing
upper bound

similarity measure

boundary points