UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Recognizing Even-Cycle and Even-Cut Matroids

Thumbnail Image

Files

Heo_Cheolwon.pdf (1.05 MB)

Date

2016-04-27

Authors

Heo, Cheolwon

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

Even-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.

Description

Keywords

even-cycle matroid, even-cut matroid, recognition algorithm, p-graphic matroid, p-cographic matroid

LC Keywords

Citation

URI

http://hdl.handle.net/10012/10407

Collections

Theses
Combinatorics and Optimization