Using contracted solution graphs for solving reconfiguration problems

DOI10.4230/LIPICS.MFCS.2016.20MaRDI QIDQ4608579zbMATH OpenOpenAlexFDO

Authors Paul Bonsma, Daniël Paulusma

Publication date 21 March 2018

Full work available at URL https://arxiv.org/abs/1509.06357

zbMATH Keywords

contractiondynamic programminggraph coloringreconfiguration

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Programming involving graphs or networks (90C35)

Abstract: 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 (2012) and Hatanaka, Ito and Zhou (2014). As a third example, we apply the method to the following problem: given two $k$-colorings $alpha$ and $$ of a graph $G$, can $alpha$ 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.

Recommendations

• Using contracted solution graphs for solving reconfiguration problems
• The coloring reconfiguration problem on specific graph classes
• Homomorphism reconfiguration via homotopy
• Complexity of coloring reconfiguration under recolorability constraints
• Introduction to reconfiguration

Cited in

(9)

• Reconfiguration in bounded bandwidth and tree-depth
• Editorial: Special issue on reconfiguration problems
• Using contracted solution graphs for solving reconfiguration problems
• Introduction to reconfiguration
• Rerouting shortest paths in planar graphs
• Algorithms for Coloring Reconfiguration Under Recolorability Constraints
• Diameter of colorings under Kempe changes
• Block symmetries in graph coloring reconfiguration systems
• Recongo: bounded combinatorial reconfiguration with answer set programming

This page was built for publication: Using contracted solution graphs for solving reconfiguration problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608579)