Recognizing Even-Cycle and Even-Cut Matroids
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.
Collections
Cite this version of the work
Cheolwon Heo
(2016).
Recognizing Even-Cycle and Even-Cut Matroids. UWSpace.
http://hdl.handle.net/10012/10407
Other formats
Related items
Showing items related by title, author, creator and subject.
-
Rayleigh Property of Lattice Path Matroids
Xu, Yan (University of Waterloo, 2015-09-22)In this work, we studied the class of lattice path matroids $\mathcal{L}$, which was first introduced by J.E. Bonin. A.D. Mier, and M. Noy in [\ref{Bonin 2002}]. Lattice path matroids are transversal, and $\mathcal{L}$ is ... -
Counting Bases
Webb, Kerri (University of Waterloo, 2004)A theorem of Edmonds characterizes when a pair of matroids has a common basis. Enumerating the common bases of a pair of matroid is a much harder problem, and includes the #P-complete problem of counting the number of ... -
Representations of even-cycle and even-cut matroids
Heo, Cheolwon (University of Waterloo, 2021-08-27)In this thesis, two classes of binary matroids will be discussed: even-cycle and even-cut matroids, together with problems which are related to their graphical representations. Even-cycle and even-cut matroids can be ...