The undirected feedback vertex set problem has a Poly(k) Kernel
Burrage, Kevin, Estivill-Castro, Vladimir, Fellows, Michael R., Langston, Michael A., Macnamara, Shev, & Rosamond, Frances A. (2006) The undirected feedback vertex set problem has a Poly(k) Kernel. In Lecture Notes in Computer Science, Springer Berlin / Heidelberg, Zurich, Switzerland, pp. 192-202.
Resolving a noted open problem, we show that the Undirected
Feedback Vertex Set problem, parameterized by the size
of the solution set of vertices, is in the parameterized complexity class Poly(k), that is, polynomial-time pre-processing is sufficient to reduce an initial problem instance (G, k) to a decision-equivalent simplified instance
(G', k') where k' � k, and the number of vertices of G' is bounded by a polynomial function of k. Our main result shows an O(k11) kernelization bound.
Citation countsare sourced monthly fromand citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Conference Paper|
|Subjects:||Australian and New Zealand Standard Research Classification > MATHEMATICAL SCIENCES (010000) > PURE MATHEMATICS (010100) > Combinatorics and Discrete Mathematics (excl. Physical Combinatorics) (010104)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
Past > Schools > Mathematical Sciences
|Copyright Owner:||Copyright 2006 Springer Verlag|
|Deposited On:||28 Sep 2011 11:59|
|Last Modified:||01 Mar 2012 00:36|
Repository Staff Only: item control page