dc.contributor.author | Fomin, Fedor | |
dc.contributor.author | Golovach, Petr | |
dc.contributor.author | Thilikos, Dimitrios M | |
dc.date.accessioned | 2020-08-03T13:32:49Z | |
dc.date.available | 2020-08-03T13:32:49Z | |
dc.date.issued | 2019 | |
dc.Published | Fomin V, Golovach P, Thilikos DM. Modification to planarity is fixed parameter tractable. Leibniz International Proceedings in Informatics. 2019;126:28 | eng |
dc.identifier.issn | 1868-8969 | en_US |
dc.identifier.uri | https://hdl.handle.net/1956/23373 | |
dc.description.abstract | A replacement action is a function L that maps each k-vertex labeled graph to another k-vertex graph. We consider a general family of graph modification problems, called L-Replacement to C, where the input is a graph G and the question is whether it is possible to replace in G some k-vertex subgraph H of it by L(H) so that the new graph belongs to the graph class C. L-Replacement to C can simulate several modification operations such as edge addition, edge removal, edge editing, and diverse completion and superposition operations. In this paper, we prove that for any action L, if C is the class of planar graphs, there is an algorithm that solves L-Replacement to C in O(|G| 2 ) steps. We also present several applications of our approach to related problems. | en_US |
dc.language.iso | eng | eng |
dc.publisher | Schloss Dagstuhl – Leibniz Center for Informatics | en_US |
dc.rights | Attribution CC BY | eng |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | eng |
dc.title | Modification to planarity is fixed parameter tractable | en_US |
dc.type | Peer reviewed | |
dc.type | Journal article | |
dc.date.updated | 2020-01-17T14:53:53Z | |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright 2019 The Authors | en_US |
dc.identifier.doi | https://doi.org/10.4230/lipics.stacs.2019.28 | |
dc.identifier.cristin | 1755747 | |
dc.source.journal | Leibniz International Proceedings in Informatics | |