Browsing University of Waterloo by Subject "treewidth"
Now showing items 1-5 of 5
-
Clifford Simulation: Techniques and Applications
(University of Waterloo, 2021-05-28)Despite the widespread belief that quantum computers cannot be efficiently simulated classically, efficient simulation is known to be possible in certain restricted regimes. In particular, the Gottesman-Knill theorem states ... -
Graph-theoretic Properties of Control Flow Graphs and Applications
(University of Waterloo, 2015-08-25)This thesis deals with determining appropriate width parameters of control flow graphs so that certain computationally hard problems of practical interest become efficiently solvable. A well-known result of Thorup states ... -
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree.
(Elsevier, 2024-01)This paper is motivated by the following question: what are the unavoidable induced subgraphs of graphs with large treewidth? Aboulker et al. made a conjecture which answers this question in graphs of bounded maximum ... -
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs.
(Elsevier, 2024-01)We say a class C of graphs is clean if for every positive integer t there exists a positive integer w(t) such that every graph in C with treewidth more than w(t) contains an induced subgraph isomorphic to one of the ... -
Tree independence number I. (Even hole, diamond, pyramid)-free graphs
(Wiley, 2024-04-24)The tree‐independence number tree‐α, first defined and studied by Dallard, Milanič, and Štorgel, is a variant of treewidth tailored to solving the maximum independent set problem. Over a series of papers, Abrishami et al. ...