Clique partitions, graph compression and speeding-up algorithms
Journal of Computer and System Sciences
Characterizing multiterminal flow networks and computing flows in networks of small treewidth
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Steiner points in tree metrics don't (really) help
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
NC-Algorithms for Graphs with Small Treewidth
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
Journal of the ACM (JACM)
Embedding k-Outerplanar Graphs into l1
SIAM Journal on Discrete Mathematics
Sparse Sourcewise and Pairwise Distance Preservers
SIAM Journal on Discrete Mathematics
Vertex sparsifiers: new results from old techniques
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A tight lower bound for the steiner point removal problem on trees
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
| Hi-index | 0.00 |
We introduce the following notion of compressing an undirected graph G with (nonnegative) edge-lengths and terminal vertices R⊆V(G). A distance-preserving minor is a minor G′ (of G) with possibly different edge-lengths, such that R⊆V(G′) and the shortest-path distance between every pair of terminals is exactly the same in G and in G′. We ask: what is the smallest f*(k) such that every graph G with k=|R| terminals admits a distance-preserving minor G′ with at most f*(k) vertices? Simple analysis shows that f*(k)≤O(k4). Our main result proves that f*(k)≥Ω(k2), significantly improving over the trivial f*(k)≥k. Our lower bound holds even for planar graphs G, in contrast to graphs G of constant treewidth, for which we prove that O(k) vertices suffice.