Distance-Preserving Graph Compression Techniques

Amirali Madani, Anil Maheshwari

We study the problem of distance-preserving graph compression for weighted paths and trees. The problem entails a weighted graph $G=(V,E)$ with non-negative weights, and a subse…