Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
A note on hyperplane generation
Journal of Combinatorial Theory Series B
Partitioning mathematical programs for parallel solution
Mathematical Programming: Series A and B
Permuting Sparse Rectangular Matrices into Block-Diagonal Form
SIAM Journal on Scientific Computing
On the Complexity of Some Enumeration Problems for Matroids
SIAM Journal on Discrete Mathematics
Determining edge connectivity in 0(nm)
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The intractability of computing the minimum distance of a code
IEEE Transactions on Information Theory
Hi-index | 0.04 |
This article studies the girth and cogirth problems for a connected matroid. The problem of finding the cogirth of a graphic matroid has been intensively studied, but studies on the equivalent problem for a vector matroid or a general matroid have been rarely reported. Based on the duality and connectivity of a matroid, we prove properties associated with the girth and cogirth of a matroid whose contraction or restriction is disconnected. Then, we devise algorithms that find the cogirth of a matroid M from the matroids associated with the direct sum components of the restriction of M. As a result, the problem of finding the (co)girth of a matroid can be decomposed into a set of smaller sub-problems, which helps alleviate the computation. Finally, we implement and demonstrate the application of our algorithms to vector matroids.