Show simple item record

dc.contributor.authorHeo, Cheolwon 17:40:32 (GMT) 17:40:32 (GMT)
dc.description.abstractEven-cycle and even-cut matroids are classes of binary matroids that generalize respectively graphic and cographic matroids. We give algorithms to check membership for these classes of matroids. We assume that the matroids are 3-connected and are given by their (0,1)-matrix representations. We first give an algorithm to check membership for p-cographic matroids that is a subclass of even-cut matroids. We use this algorithm to construct algorithms for membership problems for even-cycle and even-cut matroids and the running time of these algorithms is polynomial in the size of the matrix representations. However, we will outline only how theoretical results can be used to develop polynomial time algorithms and omit the details of algorithms.en
dc.publisherUniversity of Waterlooen
dc.subjecteven-cycle matroiden
dc.subjecteven-cut matroiden
dc.subjectrecognition algorithmen
dc.subjectp-graphic matroiden
dc.subjectp-cographic matroiden
dc.titleRecognizing Even-Cycle and Even-Cut Matroidsen
dc.typeMaster Thesisen
dc.pendingfalse and Optimizationen and Optimizationen of Waterlooen
uws-etd.degreeMaster of Mathematicsen
uws.contributor.advisorGuenin, Bertrand
uws.contributor.affiliation1Faculty of Mathematicsen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages