An improved sufficient condition for reconfiguration of list edge-colorings in a tree

Takehiro Ito, Kazuto Kawamura, Xiao Zhou

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

We study the problem of reconfiguring one list edge-coloring of a graph into another list edge-coloring by changing only one edge color assignment at a time, while at all times maintaining a list edge-coloring, given a list of allowed colors for each edge. Ito, Kamiński and Demaine gave a sufficient condition so that any list edge-coloring of a tree can be transformed into any other. In this paper, we give a new sufficient condition which improves the known one. Our sufficient condition is best possible in some sense. The proof is constructive, and yields a polynomial-time algorithm that finds a transformation between two given list edge-colorings of a tree with n vertices via O(n2) recoloring steps. We remark that the upper bound O(n 2) on the number of recoloring steps is tight, because there is an infinite family of instances on paths that satisfy our sufficient condition and whose reconfiguration requires Ω(n2) recoloring steps.

本文言語English
ホスト出版物のタイトルTheory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings
ページ94-105
ページ数12
DOI
出版ステータスPublished - 2011 5 13
イベント8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011 - Tokyo, Japan
継続期間: 2011 5 232011 5 25

出版物シリーズ

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

Other

Other8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011
国/地域Japan
CityTokyo
Period11/5/2311/5/25

ASJC Scopus subject areas

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

フィンガープリント

「An improved sufficient condition for reconfiguration of list edge-colorings in a tree」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル