The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration-Reference-Cited by-同舟云学术

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration

Published:2014 Issue: Volume: Page:110-121
ISSN:0302-9743
Container-title:Parameterized and Exact Computation
language:
Short-container-title:

Author:

Bonsma Paul,Mouawad Amer E.,Nishimura Naomi,Raman Venkatesh

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-13524-3_10

Reference20 articles.

1. Bonsma, P.: Rerouting shortest paths in planar graphs. In: FSTTCS 2012. LIPIcs, vol. 18, pp. 337–349. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)

2. Bonsma, P.: The complexity of rerouting shortest paths. Theor. Comput. Sci. 510, 1–12 (2013)

3. Bonsma, P., Cereceda, L.: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theor. Comput. Sci. 410(50), 5215–5226 (2009)

4. Lecture Notes in Computer Science;P Bonsma,2014

5. Cereceda, L.: Mixing graph colourings. Ph.D. thesis, London School of Economics (2007)

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decremental optimization of vertex-colouring under the reconfiguration framework;International Journal of Computer Mathematics: Computer Systems Theory;2023-01-02

2. Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration;WALCOM: Algorithms and Computation;2023

3. Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration;Journal of Graph Theory;2021-05-24

4. Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework;Lecture Notes in Computer Science;2021

5. Frozen (Δ + 1)-colourings of bounded degree graphs;Combinatorics, Probability and Computing;2020-10-19