文章基本信息

标题：Kernelization of Whitney Switches
本地全文：下载
作者：Fedor V. Fomin ; Petr A. Golovach
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2020
卷号：173
页码：48:1-48:19
DOI：10.4230/LIPIcs.ESA.2020.48
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Whitney switch; 2-isomorphism; Parameterized Complexity; kernelization