2026-07-20T02:31:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6435 2024-03-06T10:38:16Z ddc:004 open_access

Using Contracted Solution Graphs for Solving Reconfiguration Problems Bonsma, Paul Paulusma, Daniël reconfiguration contraction dynamic programming graph coloring 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Paul Bonsma and Daniël Paulusma 2016 Is Part Of LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2016.20 urn:nbn:de:0030-drops-64351 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.20 eng https://creativecommons.org/licenses/by/3.0/legalcode