Using contracted solution graphs for solving reconfiguration problems.

DOI10.4230/LIPIcs.MFCS.2016.20zbMath1398.90188arXiv1509.06357OpenAlexW2963007653MaRDI QIDQ4608579

Daniël Paulusma, Paul Bonsma

Publication date: 21 March 2018

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

zbMATH Keywords

dynamic programmingcontractiongraph coloringreconfiguration

Mathematics Subject Classification ID

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

Related Items (6)

Rerouting shortest paths in planar graphs ⋮ Reconfiguration in bounded bandwidth and tree-depth ⋮ Diameter of colorings under Kempe changes ⋮ Algorithms for Coloring Reconfiguration Under Recolorability Constraints ⋮ Using contracted solution graphs for solving reconfiguration problems ⋮ Introduction to reconfiguration

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