Reconfigurations of combinatorial problems : graph colouring and Hamiltonian cycle
We explore algorithmic aspects of two known combinatorial problems, Graph Colouring and Hamiltonian Cycle, by examining properties of their solution space. One can model the set of solutions of a combinatorial problem $P$ by the solution graph $R(P)$, where vertices are solutions of $P$ and there is...
| Main Author: | |
|---|---|
| Published: |
Durham University
2017
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.716267 |