Jungles, bundles, and fixed parameter tractability
classification
💻 cs.DS
math.CO
keywords
semi-completealgorithmapproximationbundlescomputingcontainmentdigraphdigraphs
read the original abstract
We give a fixed-parameter tractable (FPT) approximation algorithm computing the path-width of a tournament, and more generally, of a semi-complete digraph. Based on this result, we prove that topological containment and rooted immersion problems are FPT on semi-complete digraphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.