Jungles, bundles, and fixed parameter tractability
Fedor V. Fomin, Micha{\l} Pilipczuk
TL;DR
This paper introduces an FPT approximation algorithm for computing path-width in tournaments and semi-complete digraphs, and demonstrates that certain containment problems are also FPT within these graph classes.
Contribution
It presents the first fixed-parameter tractable approximation algorithm for path-width in semi-complete digraphs and applies this to show FPT results for topological containment and rooted immersion problems.
Findings
FPT approximation algorithm for path-width in semi-complete digraphs
FPT algorithms for topological containment problems
FPT algorithms for rooted immersion problems
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Data Management and Algorithms