Jungles, bundles, and fixed parameter tractability
Data Structures and Algorithms
2012-08-03 v2 Combinatorics
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.
Cite
@article{arxiv.1112.1538,
title = {Jungles, bundles, and fixed parameter tractability},
author = {Fedor V. Fomin and Michał Pilipczuk},
journal= {arXiv preprint arXiv:1112.1538},
year = {2012}
}
Comments
The new version contains simplified proofs providing better running times of the algorithms, as well as a wider discussion of the context