A lower bound for the tree-width of planar graphs with vital linkages

Details A lower bound for the tree-width of planar graphs with vital linkages A lower bound for the tree-width of planar graphs with vital linkages

2010-11-09

arxiv.org/abs/1011.2136v1

Computer Science

Data Structures and Algorithms

9 pages, 9 figures

Scientific paper

The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s_0,t_0), ...,(s_k,t_k), whether there are k+1 pairwise disjoint paths P_0, ...,P_k, such that P_i connects s_i to t_i. Robertson and Seymour have proven that the problem can be solved in polynomial time if k is fixed. Nevertheless, the constants involved are huge, and the algorithm is far from implementable. The algorithm uses a bound on the tree-width of graphs with vital linkages, and deletion of irrelevant vertices. We give single exponential lower bounds both for the tree-width of planar graphs with vital linkages, and for the size of the grid necessary for finding irrelevant vertices.

Affiliated with

Also associated with

No associations

Rating

A lower bound for the tree-width of planar graphs with vital linkages 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 A lower bound for the tree-width of planar graphs with vital linkages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A lower bound for the tree-width of planar graphs with vital linkages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-494000