Using contracted solution graphs for solving reconfiguration problems

Bonsma, P.; Paulusma, D.

Abstract

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.

Citation

Bonsma, P., & Paulusma, D. (2016, August). Using contracted solution graphs for solving reconfiguration problems. Presented at 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Krakow, Poland

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
• Start Date: Aug 22, 2016
• End Date: Aug 26, 2016
• Acceptance Date: Jun 5, 2016
• Publication Date: Aug 1, 2016
• Deposit Date: Oct 13, 2016
• Publicly Available Date: Oct 14, 2016
• Series Title: LIPIcs : Leibniz international proceedings in informatics
• Series Number: 58
• Series ISSN: 1868-8969
• Book Title: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22–26, 2016, Kraków, Poland.
• DOI: https://doi.org/10.4230/lipics.mfcs.2016.20
• Public URL: https://durham-repository.worktribe.com/output/1149794