Year: 2011
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Fomin, Fedor V., Pilipczuk, Michał
Institution: University of Bergen
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4300652255