Finding k Disjoint Paths in a Directed Planar Graph

Author:
  • ASAlexander Schrijver
    Alexander Schrijver

Abstract
It is shown that, for each fixed k, the problem of finding k pairwise vertex-disjoint directed paths between given pairs of terminals in a directed planar graph is solvable in polynomial time.

This publication has 5 references indexed in Scilit: