We extend recent results by Colin de Verdiere and Schrijver to prove that, for a planar graph and for terminals adjacent to at most two faces, the Min-Sum 2 Disjoint Paths Problem can be solved in polynomial time.Expand

We solve this problem affirmatively, that is, we give a first polynomial time algorithm for the directed version of 2-DSPP when the length of each edge is positive.Expand

A key theorem in algorithmic graph-minor theory is a min-max relation between the treewidth of a graph and its largest grid minor for some constant c_H .Expand