Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07281.4
URN: urn:nbn:de:0030-drops-12363
URL: https://drops.dagstuhl.de/opus/volltexte/2007/1236/
Razgon, Igor ; O'Sullivan, Barry
Directed Feedback Vertex Set is Fixed-Parameter Tractable
| pdf-format: |
|
Abstract
We resolve positively a long standing open question regarding thefixed-parameter tractability of the parameterized Directed Feedback
Vertex Set problem. In particular, we propose an algorithm which
solves this problem in $O(8^kk!*poly(n))$.
BibTeX - Entry
@InProceedings{razgon_et_al:DagSemProc.07281.4,
author = {Razgon, Igor and O'Sullivan, Barry},
title = {{Directed Feedback Vertex Set is Fixed-Parameter Tractable}},
booktitle = {Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs},
pages = {1--14},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2007},
volume = {7281},
editor = {Erik Demaine and Gregory Z. Gutin and Daniel Marx and Ulrike Stege},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2007/1236},
URN = {urn:nbn:de:0030-drops-12363},
doi = {10.4230/DagSemProc.07281.4},
annote = {Keywords: Directed FVS, Multicut, Directed Acyclic Graph (DAG)}
}
| Keywords: | Directed FVS, Multicut, Directed Acyclic Graph (DAG) | |
| Seminar: | 07281 - Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs | |
| Issue date: | 2007 | |
| Date of publication: | 28.11.2007 |
