Browsing Mathematics (Faculty of) by Subject "cutwidth"
Now showing items 1-2 of 2
-
Related Orderings of AT-Free Graphs
(University of Waterloo, 2022-02-23)An ordering of a graph G is a bijection of V(G) to {1, . . . , |V(G)|}. In this thesis, we consider the complexity of two types of ordering problems. The first type of problem we consider aims at minimizing objective ... -
Updating the Vertex Separation of a Dynamically Changing Tree
(University of Waterloo, 2004)This thesis presents several algorithms that update the vertex separation of a tree after the tree is modified; the vertex separation of a graph measures the largest number of vertices to the left of and including a vertex ...