Parameterized complexity of the list coloring reconfiguration problem with graph parameters

Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

Let G be a graph such that each vertex has its list of available colors, and assume that each list is a subset of the common set consisting of k colors. For two given list colorings of G, we study the problem of transforming one into the other by changing only one vertex color assignment at a time, while at all times maintaining a list coloring. This problem is known to be PSPACEcomplete even for bounded bandwidth graphs and a fixed constant k. In this paper, we study the fixed-parameter tractability of the problem when parameterized by several graph parameters. We first give a fixed-parameter algorithm for the problem when parameterized by k and the modular-width of an input graph. We next give a fixed-parameter algorithm for the shortest variant which computes the length of a shortest transformation when parameterized by k and the size of a minimum vertex cover of an input graph. As corollaries, we show that the problem for cographs and the shortest variant for split graphs are fixed-parameter tractable even when only k is taken as a parameter. On the other hand, we prove that the problem is W[1]-hard when parameterized only by the size of a minimum vertex cover of an input graph.

本文言語English
ホスト出版物のタイトル42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
編集者Kim G. Larsen, Jean-Francois Raskin, Hans L. Bodlaender
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959770460
DOI
出版ステータスPublished - 2017 11 1
イベント42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 - Aalborg, Denmark
継続期間: 2017 8 212017 8 25

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
83
ISSN(印刷版)1868-8969

Other

Other42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
CountryDenmark
CityAalborg
Period17/8/2117/8/25

ASJC Scopus subject areas

  • Software

フィンガープリント 「Parameterized complexity of the list coloring reconfiguration problem with graph parameters」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル