Almost optimal distance oracles for planar graphs.

Panagiotis Charalampopoulos Pawel Gawrychowski Shay Mozes Oren Weimann

Published in: STOC (2019)

Keyphrases

planar graphs
distance function
image segmentation
optimal solution
dynamic programming
upper bound
worst case
minimum cost