3 citations · 13 across the 8 of their papers we have counts for
1 paper · 1 filter
Walter Kern, Barnaby Martin, Daniël Paulusma +2
The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k distinct pairs. We deter…