Browsing Theses by Subject "dominating set"
Now showing items 1-2 of 2
-
On Reconfiguration Problems: Structure and Tractability
(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 ... -
Transversal Problems In Sparse Graphs
(University of Waterloo, 2022-09-20)Graph transversals are a classical branch of graph algorithms. In such a problem, one seeks a minimum-weight subset of nodes in a node-weighted graph $G$ which intersects all copies of subgraphs~$F$ from a fixed family ...