Proceedings Article, Paper @InProceedings Beitrag in Tagungsband, Workshop

 Show entries of: this year (2019) | last year (2018) | two years ago (2017) | Notes URL
 Action: login to update Options: Library locked Goto entry point

 Author, Editor
 Author(s): Kim, Eun Jung Paul, Christophe Philip, Geevarghese dblp dblp dblp Not MPG Author(s): Kim, Eun Jung Paul, Christophe
 Editor(s): Fomin, Fedor V. Kaski, Petteri dblp dblp Not MPII Editor(s): Fomin, Fedor V. Kaski, Petteri
 BibTeX cite key*: KimPaulPhilip2012

 Title, Booktitle
 Title*: A Single-exponential FPT Algorithm for the K4-Minor Cover Problem swat-lncs.pdf (335.96 KB) Booktitle*: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops

 Event, URLs
 URL of the conference: http://swat2012.helsinki.fi/ URL for downloading the paper: http://link.springer.com/chapter/10.1007%2F978-3-642-31155-0_11 Event Address*: Helsinki, Finland Language: English Event Date* (no longer used): Organization: Event Start Date: 4 July 2012 Event End Date: 6 July 2012

 Publisher
 Name*: Springer URL: http://www.springer.com Address*: Berlin Type:

 Vol, No, Year, pp.
 Series: Lecture Notes in Computer Science
 Volume: 7357 Number: Month: Pages: 119-130 Year*: 2012 VG Wort Pages: ISBN/ISSN: 978-3-642-31154-3 Sequence Number: DOI: 10.1007/978-3-642-31155-0_11

 (LaTeX) Abstract: Given an input graph $G$ on $$n$$ vertices and an integer $k$, the parameterized \textsc{$K_4$-minor cover} problem asks whether there is a set $S$ of at most $k$ vertices whose deletion results in a $K_4$-minor free graph or, equivalently, in a graph of treewidth at most $2$. The problem can thus also be called \textsc{Treewidth-$2$ Vertex Deletion}. This problem is inspired by two well-studied parameterized vertex deletion problems, \textsc{Vertex Cover} and \textsc{Feedback Vertex Set}, which can be expressed as \textsc{Treewidth-$t$ Vertex Deletion} problems: $t=0$ for {\sc Vertex Cover} and $t=1$ for {\sc Feedback Vertex Set}. While a single-exponential FPT algorithm has been known for a long time for \textsc{Vertex Cover}, such an algorithm for \textsc{Feedback Vertex Set} was devised comparatively recently. While it is known to be unlikely that \textsc{Treewidth-$t$ Vertex Deletion} can be solved in time $c^{o(k)}\cdot n^{O(1)}$, it was open whether the \textsc{$K_4$-minor cover} could be solved in single-exponential FPT time, i.e. in $c^k\cdot n^{O(1)}$ time. This paper answers this question in the affirmative. URL for the Abstract: http://link.springer.com/chapter/10.1007%2F978-3-642-31155-0_11 Keywords: Parameterized Algorithms, Vertex Deletion Problems, Treewidth Copyright Message: Copyright Springer-Verlag Berlin Heidelberg 2012. This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, speciﬁcally the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microﬁlms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Published in the Proceedings of SWAT 2012, Helsinki, Finland, July 4-6, 2012. Lecture Notes in Computer Science, Volume 7357. The original publication is available at www.springerlink.com: http://www.springerlink.com/content/q72h573085148563/ Download Access Level: Public

 Correlation
 MPG Unit: Max-Planck-Institut für Informatik MPG Subunit: Algorithms and Complexity Group Appearance: MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort

BibTeX Entry:

@INPROCEEDINGS{KimPaulPhilip2012,
AUTHOR = {Kim, Eun Jung and Paul, Christophe and Philip, Geevarghese},
EDITOR = {Fomin, Fedor V. and Kaski, Petteri},
TITLE = {A Single-exponential {FPT} Algorithm for the {K4}-Minor Cover Problem},
BOOKTITLE = {Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops},
PUBLISHER = {Springer},
YEAR = {2012},
VOLUME = {7357},
PAGES = {119--130},
SERIES = {Lecture Notes in Computer Science},