We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Using contracted solution graphs for solving reconfiguration problems.

Bonsma, P. and Paulusma, D. (2016) 'Using contracted solution graphs for solving reconfiguration problems.', in 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22–26, 2016, Kraków, Poland. Dagstuhl, Germany: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, p. 20. LIPIcs : Leibniz international proceedings in informatics. (58).


We introduce a dynamic programming method for solving reconfiguration problems, based on contracted solution graphs, which are obtained from solution graphs by performing an appropriate series of edge contractions that decrease the graph size without losing any critical information needed to solve the reconfiguration problem under consideration. As an example, we consider a well-studied problem: given two k-colorings alpha and beta of a graph G, can alpha be modified into beta by recoloring one vertex of G at a time, while maintaining a k-coloring throughout? By applying our method in combination with a thorough exploitation of the graph structure we obtain a polynomial-time algorithm for (k-2)-connected chordal graphs.

Item Type:Book chapter
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution.
Download PDF
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution.
Download PDF
Publisher Web site:
Publisher statement:© Paul Bonsma and Daniël Paulusma; licensed under Creative Commons License CC-BY
Date accepted:05 June 2016
Date deposited:14 October 2016
Date of first online publication:August 2016
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar