The Directed Disjoint Paths Problem is defined as follows. We are given a directed graph G and k pairs of nodes (s1, t1), (s2, t2),(sk, tk). The problem is to decide whether there exist node-disjoint paths P1, P2,..., Pk so that Pi goes from si to ti.
Show that Directed Disjoint Paths is NP-complete.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.