Packing Directed Joins

dc.contributor.author	Williams, Aaron	en
dc.date.accessioned	2006-08-22T14:21:45Z
dc.date.available	2006-08-22T14:21:45Z
dc.date.issued	2004	en
dc.date.submitted	2004	en
dc.description.abstract	Edmonds and Giles conjectured that the maximum number of directed joins in a packing is equal to the minimum weight of a directed cut, for any weighted directed graph. This is a generalization of Woodall's Conjecture (which is still open). Schrijver found the first known counterexample to the Edmonds-Giles Conjecture, while Cornuejols and Guenin found the next two. In this thesis we introduce new counterexamples, and prove that all minimal counterexamples of a certain type have now been found.	en
dc.format	application/pdf	en
dc.format.extent	1797821 bytes
dc.format.mimetype	application/pdf
dc.identifier.uri	http://hdl.handle.net/10012/1024
dc.language.iso	en	en
dc.pending	false	en
dc.publisher	University of Waterloo	en
dc.rights	Copyright: 2004, Williams, Aaron. All rights reserved.	en
dc.subject	Mathematics	en
dc.subject	directed graph	en
dc.subject	directed cut	en
dc.subject	directed join	en
dc.subject	min-max	en
dc.subject	Woodall's Conjecture	en
dc.subject	Edmonds-Giles Conjecture	en
dc.title	Packing Directed Joins	en
dc.type	Master Thesis	en
uws-etd.degree	Master of Mathematics	en
uws-etd.degree.department	Combinatorics and Optimization	en
uws.peerReviewStatus	Unreviewed	en
uws.scholarLevel	Graduate	en
uws.typeOfResource	Text	en

Files

Now showing 1 - 1 of 1