Preserving Terminal Distances using Minors

Details Preserving Terminal Distances using Minors Preserving Terminal Distances using Minors

2012-02-25

arxiv.org/abs/1202.5675v1

Computer Science

Data Structures and Algorithms

Scientific paper

We introduce the following notion of compressing an undirected graph G with edge-lengths and terminal vertices $R\subseteq V(G)$. A distance-preserving minor is a minor G' (of G) with possibly different edge-lengths, such that $R\subseteq V(G')$ and the shortest-path distance between every pair of terminals is exactly the same in G and in G'. 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)\leq O(k^4)$. Our main result proves that $f*(k)\geq \Omega(k^2)$, significantly improving over the trivial $f*(k)\geq 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.

Affiliated with

Also associated with

No associations

Rating

Preserving Terminal Distances using Minors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Preserving Terminal Distances using Minors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preserving Terminal Distances using Minors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-291490