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): Philip, Geevarghese Raman, Venkatesh Villanger, Yngve dblp dblp dblp Not MPG Author(s): Raman, Venkatesh Villanger, Yngve
 Editor(s): Thilikos, Dimitrios M. dblp Not MPII Editor(s): Thilikos, Dimitrios M.
 BibTeX cite key*: PhilipRamanVillanger2010

 Title, Booktitle
 Title*: A Quartic Kernel for Pathwidth-One Vertex Deletion pwone.pdf (444.03 KB) Booktitle*: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers

 Event, URLs
 URL of the conference: http://wg2010.thilikos.info/ URL for downloading the paper: http://www.springerlink.com/content/a675490567000012/fulltext.pdf Event Address*: Crete, Greece Language: English Event Date* (no longer used): Organization: Event Start Date: 28 June 2010 Event End Date: 30 June 2010

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

 Vol, No, Year, pp.
 Series: Lecture Notes in Computer Science
 Volume: 6410 Number: Month: Pages: 196-207 Year*: 2010 VG Wort Pages: ISBN/ISSN: 978-3-642-16925-0 Sequence Number: DOI: 10.1007/978-3-642-16926-7_19

 (LaTeX) Abstract: The pathwidth of a graph is a measure of how path-like the graph is. Given a graph $G$ and an integer $k$, the problem of finding whether there exist at most $k$ vertices in $G$ whose deletion results in a graph of pathwidth at most one is \npc{}. We initiate the study of the parameterized complexity of this problem, parameterized by $k$. We show that the problem has a quartic vertex-kernel: We show that, given an input instance $(G=(V,E),k);|V|=n$, we can construct, in polynomial time, an instance $(G',k')$ such that (i) $(G,k)$ is a YES instance if and only if $(G',k')$ is a YES instance, (ii) $G'$ has $\Oh(k^{4})$ vertices, and (iii) $k'\le k$. We also give a fixed parameter tractable (FPT) algorithm for the problem that runs in $\Oh(7^{k}k\cdot n^{2})$ time. URL for the Abstract: http://www.springerlink.com/content/a675490567000012/ Keywords: Parameterized Algorithms, Kernelization, Pathwidth-One Deletion Copyright Message: Copyright Springer-Verlag Berlin Heidelberg 2010. 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 Revised Papers of WG 2010, Crete, Greece, June 28-30, 2010. Lecture Notes in Computer Science, Volume 6410. The original publication is available at www.springerlink.com : http://www.springerlink.com/content/a675490567000012/ Download Access Level: Public

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

BibTeX Entry:

@INPROCEEDINGS{PhilipRamanVillanger2010,
AUTHOR = {Philip, Geevarghese and Raman, Venkatesh and Villanger, Yngve},
EDITOR = {Thilikos, Dimitrios M.},
TITLE = {A Quartic Kernel for Pathwidth-One Vertex Deletion},
BOOKTITLE = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar{\'o}s, Crete, Greece, June 28-30, 2010 Revised Papers},
PUBLISHER = {Springer},
YEAR = {2010},
TYPE = {Revised Paper},
VOLUME = {6410},
PAGES = {196--207},
SERIES = {Lecture Notes in Computer Science},
ISBN = {978-3-642-16925-0},
DOI = {10.1007/978-3-642-16926-7_19},
}

Edit History (please click the blue arrow to see the details)

 Editor(s) [Library] Created 04/21/2012 04:32:48 PM Revisions 2. 1. 0. Editor(s) Geevarghese Philip Geevarghese Philip Geevarghese Philip Edit Dates 04/21/2012 04:49:57 PM 04/21/2012 04:37:35 PM 04/21/2012 04:32:48 PM
Attachment Section

View attachments here: