Browsing Theses by Subject "reconfiguration"

Now showing items 1-4 of 4

Building a larger class of graphs for efficient reconfiguration of vertex colouring

Merkel, Owen (University of Waterloo, 2020-05-13)

A $k$-colouring of a graph $G$ is an assignment of at most $k$ colours to the vertices of $G$ so that adjacent vertices are assigned different colours. The reconfiguration graph of the $k$-colourings, $\mathcal{R}_k(G)$, ...
On Reconfiguration Problems: Structure and Tractability

Mouawad, Amer (University of Waterloo, 2015-02-18)

Given an n-vertex graph G and two vertices s and t in G, determining whether there exists a path and computing the length of the shortest path between s and t are two of the most fundamental graph problems. In the classical ...
On the Complexity of Reconfiguration of Clique, Cluster Vertex Deletion, and Dominating Set

Tebbal, Youcef (University of Waterloo, 2015-07-15)

A graph problem P is a vertex-subset problem if feasible solutions for P consist of subsets of the vertices of a graph G. The st-connectivity problem for a vertex-subset problem P takes as input two feasible solutions ...
Reconfiguring Triangulations

Pathak, Vinayak (University of Waterloo, 2015-01-06)

The results in this thesis lie at the confluence of triangulations and reconfiguration. We make the observation that certain solved and unsolved problems about triangulations can be cast as reconfiguration problems. We ...