dc.contributor.author | Fomin, Fedor | |
dc.contributor.author | Golovach, Petr | |
dc.date.accessioned | 2021-05-19T12:15:10Z | |
dc.date.available | 2021-05-19T12:15:10Z | |
dc.date.created | 2021-01-04T12:01:45Z | |
dc.date.issued | 2020 | |
dc.Published | Leibniz International Proceedings in Informatics. 2020, 173 48:1-48:19. | |
dc.identifier.issn | 1868-8969 | |
dc.identifier.uri | https://hdl.handle.net/11250/2755696 | |
dc.description.abstract | A fundamental theorem of Whitney from 1933 asserts that 2-connected graphs G and H are 2-isomorphic, or equivalently, their cycle matroids are isomorphic, if and only if G can be transformed into H by a series of operations called Whitney switches. In this paper we consider the quantitative question arising from Whitney’s theorem: Given 2-isomorphic graphs, can we transform one into another by applying at most k Whitney switches? This problem is already NP-complete for cycles, and we investigate its parameterized complexity. We show that the problem admits a kernel of size 𝒪(k), and thus, is fixed-parameter tractable when parameterized by k. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Dagstuhl Publishing | en_US |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | Kernelization of Whitney Switches | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright 2020 The Authors | en_US |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |
dc.identifier.doi | 10.4230/LIPIcs.ESA.2020.48 | |
dc.identifier.cristin | 1864718 | |
dc.source.journal | Leibniz International Proceedings in Informatics | en_US |
dc.source.40 | 173 | |
dc.source.pagenumber | 48:1-48:19 | en_US |
dc.relation.project | Norges forskningsråd: 263317 | en_US |
dc.identifier.citation | Leibniz International Proceedings in Informatics. 2020, 173, 48:1-48:19 | en_US |
dc.source.volume | 173 | en_US |