Now showing items 1-2 of 2
Algorithms to Find the Girth and Cogirth of a Linear Matroid
In this thesis, I present algorithms to find the cogirth and girth, the cardinality of the smallest cocircuit and circuit respectively, of a linear matroid. A set covering problem (SCP) formulation of the problems is ...
Cocircuits of vector matroids
In this thesis, I present a set covering problem (SCP) formulation of the matroid cogirth problem, finding the cardinality of the smallest cocircuit of a matroid. Addressing the matroid cogirth problem can lead to significantly ...