The complexity of (list) edge-coloring reconfiguration problem

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

Let G be a graph such that each edge has its list of available colors, and assume that each list is a subset of the common set consisting of k colors. Suppose that we are given two list edge-colorings f0 and fr of G, and asked whether there exists a sequence of list edge-colorings of G between f0 and fr such that each list edge-coloring can be obtained from the previous one by changing a color assignment of exactly one edge. This problem is known to be PSPACE-complete for every integer k ≥ 6 and planar graphs of maximum degree three, but any computational hardness was unknown for the non-list variant in which every edge has the same list of k colors. In this paper, we first improve the known result by proving that, for every integer k ≥ 4, the problem remains PSPACE-complete even for planar graphs of maximum degree three and bounded bandwidth. Since the problem is known to be solvable in polynomial time if k ≤ 3, our result gives a sharp analysis of the complexity status with respect to the number k of colors. We then give the first computational hardness result for the non-list variant: for every integer k ≥ 5, the nonlist variant is PSPACE-complete even for planar graphs of maximum degree k and bandwidth linear in k.

本文言語English
ホスト出版物のタイトルWALCOM
ホスト出版物のサブタイトルAlgorithms and Computation - 11th International Conference and Workshops, WALCOM 2017, Proceedings
編集者Md. Saidur Rahman, Hsu-Chun Yen, Sheung-Hung Poon
出版社Springer Verlag
ページ347-358
ページ数12
ISBN(印刷版)9783319539249
DOI
出版ステータスPublished - 2017
イベント11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 - Hsinchu, Taiwan, Province of China
継続期間: 2017 3 292017 3 31

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10167 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017
国/地域Taiwan, Province of China
CityHsinchu
Period17/3/2917/3/31

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

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

引用スタイル