Use this URL to cite or link to this record in EThOS: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.716267
Title: Reconfigurations of combinatorial problems : graph colouring and Hamiltonian cycle
Author: Lignos, Ioannis
ISNI:       0000 0004 6350 402X
Awarding Body: Durham University
Current Institution: Durham University
Date of Award: 2017
Availability of Full Text:
 Access from EThOS: Access from Institution:
Abstract:
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 an edge between two vertices, when the two corresponding solutions satisfy an adjacency reconfiguration rule. For example, we can define the reconfiguration rule for graph colouring to be that two solutions are adjacent when they differ in colour in exactly one vertex. The exploration of the properties of the solution graph \$R(P)\$ can give rise to interesting questions. The connectivity of \$R(P)\$ is the most prominent question in this research area. This is reasonable, since the main motivation for modelling combinatorial solutions as a graph is to be able to transform one into the other in a stepwise fashion, by following paths between solutions in the graph. Connectivity questions can be made binary, that is expressed as decision problems which accept a 'yes' or 'no' answer. For example, given two specific solutions, is there a path between them? Is the graph of solutions \$R(P)\$ connected? In this thesis, we first show that the diameter of the solution graph \$R_{l}(G)\$ of vertex \$l\$-colourings of k-colourable chordal and chordal bipartite graphs \$G\$ is \$O(n^2)\$, where \$l > k\$ and n is the number of vertices of \$G\$. Then, we formulate a decision problem on the connectivity of the graph colouring solution graph, where we allow extra colours to be used in order to enforce a path between two colourings with no path between them. We give some results for general instances and we also explore what kind of graphs pose a challenge to determine the complexity of the problem for general instances. Finally, we give a linear algorithm which decides whether there is a path between two solutions of the Hamiltonian Cycle Problem for graphs of maximum degree five, and thus providing insights towards the complexity classification of the decision problem.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.716267  DOI: Not available
Share: