Near-Optimal Distance Emulator for Planar Graphs

Hsien-Chih Chang, Paweł Gawrychowski, Shay Mozes +1

Given a graph $G$ and a set of terminals $T$, a \emph{distance emulator} of $G$ is another graph $H$ (not necessarily a subgraph of $G$) containing $T$, such that all the pairwise…