Browsing Theses by Supervisor "Edmonds, Jack"
Now showing items 1-2 of 2
-
FACES OF MATCHING POLYHEDRA
(University of Waterloo, 2016-09-30)Let G = (V, E, ~) be a finite loopless graph, let b=(bi:ieV) be a vector of positive integers. A feasible matching is a vector X = (x.: j e: E) J of nonnegative integers such that for each node i of G, the sum of ... -
SUBMODULAR FUNCTIONS, GRAPHS AND INTEGER POLYHEDRA
(University of Waterloo, 2016-09-12)This thesis is a study of the faces of certain combinatorially defined polyhedra. In particular, we examine the vertices and facets of these polyhedra. Chapter 2 contains the essential mathematical background in polyhedral ...