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

Takehiro Ito; Kazuto Kawamura; Xiao Zhou

doi:10.1007/978-3-642-20877-5_10

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

Takehiro Ito, Kazuto Kawamura, Xiao Zhou

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

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(n²) recoloring steps. We remark that the upper bound O(n ²) 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 Ω(n²) recoloring steps.

Original language	English
Title of host publication	Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings
Pages	94-105
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-20877-5_10
Publication status	Published - 2011 May 13
Event	8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011 - Tokyo, Japan Duration: 2011 May 23 → 2011 May 25

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6648 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011
Country	Japan
City	Tokyo
Period	11/5/23 → 11/5/25

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-20877-5_10

Fingerprint Dive into the research topics of 'An improved sufficient condition for reconfiguration of list edge-colorings in a tree'. Together they form a unique fingerprint.

Cite this

Ito, T., Kawamura, K., & Zhou, X. (2011). An improved sufficient condition for reconfiguration of list edge-colorings in a tree. In Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings (pp. 94-105). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6648 LNCS). https://doi.org/10.1007/978-3-642-20877-5_10

An improved sufficient condition for reconfiguration of list edge-colorings in a tree. / Ito, Takehiro; Kawamura, Kazuto; Zhou, Xiao.

Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings. 2011. p. 94-105 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6648 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ito, T, Kawamura, K & Zhou, X 2011, An improved sufficient condition for reconfiguration of list edge-colorings in a tree. in Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6648 LNCS, pp. 94-105, 8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011, Tokyo, Japan, 11/5/23. https://doi.org/10.1007/978-3-642-20877-5_10

Ito T, Kawamura K, Zhou X. An improved sufficient condition for reconfiguration of list edge-colorings in a tree. In Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings. 2011. p. 94-105. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-20877-5_10

Ito, Takehiro ; Kawamura, Kazuto ; Zhou, Xiao. / An improved sufficient condition for reconfiguration of list edge-colorings in a tree. Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings. 2011. pp. 94-105 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9d7513f0e6f34fab86f6f31ce57707df,

title = "An improved sufficient condition for reconfiguration of list edge-colorings in a tree",

abstract = "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{\'n}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.",

author = "Takehiro Ito and Kazuto Kawamura and Xiao Zhou",

year = "2011",

month = may,

day = "13",

doi = "10.1007/978-3-642-20877-5_10",

language = "English",

isbn = "9783642208768",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "94--105",

booktitle = "Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings",

note = "8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011 ; Conference date: 23-05-2011 Through 25-05-2011",

}

TY - GEN

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

AU - Ito, Takehiro

AU - Kawamura, Kazuto

AU - Zhou, Xiao

PY - 2011/5/13

Y1 - 2011/5/13

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79955747577&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955747577&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-20877-5_10

DO - 10.1007/978-3-642-20877-5_10

M3 - Conference contribution

AN - SCOPUS:79955747577

SN - 9783642208768

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 94

EP - 105

BT - Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings

T2 - 8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011

Y2 - 23 May 2011 through 25 May 2011

ER -