Disjoint paths in tournaments
暂无分享,去创建一个
Abstract Given k pairs of vertices ( s i , t i ) ( 1 ≤ i ≤ k ) of a digraph G, how can we test whether there exist k vertex-disjoint directed paths from s i to t i for 1 ≤ i ≤ k ? This is NP-complete in general digraphs, even for k = 2 [2] , but for k = 2 there is a polynomial-time algorithm when G is a tournament (or more generally, a semicomplete digraph), due to Bang-Jensen and Thomassen [1] . Here we prove that for all fixed k there is a polynomial-time algorithm to solve the problem when G is semicomplete.
[1] Paul D. Seymour,et al. Edge-disjoint paths in digraphs with bounded independence number , 2015, J. Comb. Theory, Ser. B.
[2] Carsten Thomassen,et al. A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs , 1992, SIAM J. Discret. Math..
[3] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..
[4] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.