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. (2019) 'Using contracted solution graphs for solving reconfiguration problems.', Acta informatica., 56 (7-8). pp. 619-648.


We introduce in a general setting a dynamic programming method for solving reconfiguration problems. Our method is 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. Our general framework captures the approach behind known reconfiguration results of Bonsma (Discrete Appl Math 231:95–112, 2017) and Hatanaka et al. (IEICE Trans Fundam Electron Commun Comput Sci 98(6):1168–1178, 2015). As a third example, we apply the method to the following well-studied problem: given two k-colorings α and β of a graph G, can α be modified into β by recoloring one vertex of G at a time, while maintaining a k-coloring throughout? This problem is known to be PSPACE-hard even for bipartite planar graphs and k=4 . 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:Article
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:This is a post-peer-review, pre-copyedit version of an article published in Acta informatica. The final authenticated version is available online at:
Date accepted:20 May 2019
Date deposited:21 May 2019
Date of first online publication:31 May 2019
Date first made open access:31 May 2020

Save or Share this output

Look up in GoogleScholar