Directed Tangle Tree-Decompositions and Applications
Archontia C. Giannopoulou, Ken‐ichi Kawarabayashi, Stephan Kreutzer, O‐joung Kwon · Society for Industrial and Applied Mathematics eBooks · 2022
The tangle tree-decomposition theorem, proved by Robertson and Seymour in their seminal graph minors series, turns out to be an extremely valuable tool in structural and algorithmic graph theory. In this paper, we prove the analogous result for digraphs, the directed tangle tree-decomposition theorem. More precisely, we introduce directed tangles and provide a directed tree-decomposition of digraphs G that distinguishes all maximal directed tangles in G. Furthermore, for any integer k, we construct a directed tree-decomposition that distinguishes all directed tangles of order k. By relaxing the bound slightly, we can make the previous result algorithmic: for fixed k, we design a polynomial-time algorithm that finds a directed tree-decomposition distinguishing all directed tangles of order 6k–1 separated by some separation of order less than k. As a direct application of the tangle tree-decomposition theorem, we prove that for every fixed k there is a polynomial-time algorithm which, on input G, and source and sink vertices (s1, t1),…, (sk, tk), either finds a family of paths P1,…, Pk such that each Pi links si to ti and every vertex of G is contained in at most two paths, or determines that there is no set of pairwise vertex-disjoint paths each connecting si to ti. This result improves previous results (with “two” replaced by “three”), and given known hardness results, our result cannot be extended to fixed parameter tractability nor fully vertex-disjoint directed paths.