8 citations · 66 across the 52 of their papers we have counts for
1 paper · 2 filters
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…