The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments

R. Krithika, Abhishek Sahu, Saket Saurabh +1

Given a directed graph $D$ on $n$ vertices and a positive integer $k$, the Arc-Disjoint Cycle Packing problem is to determine whether $D$ has $k$ arc-disjoint cycles. This problem…