Covering planar metrics (and beyond): O (1) trees suffice
While research on the geometry of planar graphs has been active in the past decades, many
properties of planar metrics remain mysterious. This paper studies a fundamental aspect of …
properties of planar metrics remain mysterious. This paper studies a fundamental aspect of …
Better distance labeling for unweighted planar graphs
P Gawrychowski, P Uznański - Algorithmica, 2023 - Springer
A distance labeling scheme is an assignment of labels, that is, binary strings, to all nodes of
a graph, so that the distance between any two nodes can be computed from their labels …
a graph, so that the distance between any two nodes can be computed from their labels …
Approximate distance oracles for planar graphs with subpolynomial error dependency
H Le - Proceedings of the 2023 Annual ACM-SIAM …, 2023 - SIAM
Thorup [FOCS'01, JACM'04] and Klein [SODA'01] independently showed that there exists a
(1+ ε)-approximate distance oracle for planar graphs with O (n (log n) ε-1) space and O (ε-1) …
(1+ ε)-approximate distance oracle for planar graphs with O (n (log n) ε-1) space and O (ε-1) …
Learned Approximate Distance Labels for Graphs
I Abioye, A Gunby-Mann, X Wang, S Cohen… - … Conference on Complex …, 2023 - Springer
Distance computation is a fundamental problem in algorithmic graph theory with broad
applications across various fields. Distance labeling is the method of assigning a label ℓ to …
applications across various fields. Distance labeling is the method of assigning a label ℓ to …