An FPT algorithm for Tree Deletion Set
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F13%3A00209343" target="_blank" >RIV/68407700:21240/13:00209343 - isvavai.cz</a>
Result on the web
<a href="http://jgaa.info/getPaper?id=308" target="_blank" >http://jgaa.info/getPaper?id=308</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.7155/jgaa.00308" target="_blank" >10.7155/jgaa.00308</a>
Alternative languages
Result language
angličtina
Original language name
An FPT algorithm for Tree Deletion Set
Original language description
We give a~$5^k n^{O(1)}$ time fixed-parameter algorithm for determining whether a given undirected graph on~$n$ vertices has a subset of at most~$k$ vertices whose deletion results in a tree. Such a subset is a restricted form of a feedback vertex set. While parameterized complexity of feedback vertex set problem and several of its variations have been well studied, to the best of our knowledge, this is the first fixed-parameter algorithm for this version of feedback vertex set.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Graph Algorithms and Applications
ISSN
1526-1719
e-ISSN
—
Volume of the periodical
17
Issue of the periodical within the volume
6
Country of publishing house
US - UNITED STATES
Number of pages
14
Pages from-to
615-628
UT code for WoS article
—
EID of the result in the Scopus database
—