Vertex Disjoint Path in Upward Planar Graphs

Saeed Amiri, Ali Golshani, Stephan Kreutzer +1

The $k$-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time f…