Browsing Theses by Subject "Erdős–Pósa"
Now showing items 1-1 of 1
-
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 ...