M. Johnson
Knocking Out P_k-free Graphs
Johnson, M.; Paulusma, D.; Stewart, A.
Authors
Contributors
Ersébet Csuhaj-Varjú
Editor
Martin Dietzfelbinger
Editor
Zoltán Ésik
Editor
Abstract
A parallel knock-out scheme for a graph proceeds in rounds in each of which each surviving vertex eliminates one of its surviving neighbours. A graph is KO-reducible if there exists such a scheme that eliminates every vertex in the graph. The Parallel Knock-Out problem is to decide whether a graph G is KO-reducible. This problem is known to be NP-complete and has been studied for several graph classes since MFCS 2004. We show that the problem is NP-complete even for split graphs, a subclass of P 5-free graphs. In contrast, our main result is that it is linear-time solvable for P 4-free graphs (cographs).
Citation
Johnson, M., Paulusma, D., & Stewart, A. (2014). Knocking Out P_k-free Graphs. In E. Csuhaj-Varjú, M. Dietzfelbinger, & Z. Ésik (Eds.), 39th International Symposium, MFCS 2014, Budapest, Hungary, 26-29August 2014 ; proceedings, Part II (396-407). https://doi.org/10.1007/978-3-662-44465-8_34
Conference Name | 39th International Symposium, MFCS 2014 |
---|---|
Conference Location | Budapest, Hungary |
Publication Date | Jan 1, 2014 |
Deposit Date | Dec 20, 2014 |
Publicly Available Date | Jan 15, 2015 |
Pages | 396-407 |
Series Title | Lecture notes in computer science |
Series Number | 8635 |
Series ISSN | 0302-9743,1611-3349 |
Book Title | 39th International Symposium, MFCS 2014, Budapest, Hungary, 26-29August 2014 ; proceedings, Part II. |
ISBN | 9783662444641 |
DOI | https://doi.org/10.1007/978-3-662-44465-8_34 |
Public URL | https://durham-repository.worktribe.com/output/1153089 |
Files
Accepted Conference Proceeding
(339 Kb)
PDF
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44465-8_34
You might also like
Knocking out P_k-free graphs
(2015)
Journal Article
Minimal disconnected cuts in planar graphs
(2015)
Conference Proceeding
Matching cuts in graphs of high girth and H-free graphs
(2023)
Conference Proceeding
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
(2023)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search