Near-Optimal Compression for the Planar Graph Metric

14 Mar 2017 Abboud Amir Gawrychowski Pawel Mozes Shay Weimann Oren

The Planar Graph Metric Compression Problem is to compactly encode the distances among $k$ nodes in a planar graph of size $n$. Two na\"ive solutions are to store the graph using $O(n)$ bits, or to explicitly store the distance matrix with $O(k^2 \log{n})$ bits... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS

Datasets


  Add Datasets introduced or used in this paper