A tournament is a directed graph in which there single arc between every pair of distinct vertices. Given T on n vertices, we explore the classical and parameterized complexity problems determining if has cycle packing (a set pairwise arc-disjoint cycles) size k triangle triangles) k. We refer to these as Arc-disjoint Cycles Tournaments (ACT) Triangles (ATT), respectively. Although maximization...

We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and link-disjoint cases. Our major results include a novel polynomial time algorithm that optimally solves the minimum energy 2 link-disjoint paths problem, as well as a polynomial time algorithm for the minimum energy k node-disjoint paths problem. In addition, we present efficient heu...