# Oct 20, 2015: Paul Bonsma: Algorithmic techniques for reconfiguration problems

October 20, 2015 | Algorithmic techniques for reconfiguration problems |

Room: HB 2A | Paul Bonsma |

12:30-13:30 | Reconfiguration problems are computational or combinatorial problems related to the exploration of symmetric solution/state spaces. A solution graph (or reconfiguration graph) concept S is obtained by defining problem instances (such as graphs), solutions for these instances (such as proper colorings of the graph), and a symmetric adjacency relation between the solutions (such as recoloring a single vertex). This defines a solution graph S(G) for each instance G. |