Abstract
We give polynomial-time randomized algorithms for computing the girth and the cogirth of binary matroids that are low-rank perturbations of graphic matroids.
Similar content being viewed by others
References
F. Barahona and M. Conforti: A construction for binary matroids, Discrete Math. 66 (1987), 213–218.
M. Conforti and M. R. Rao: Some new matroids on graphs: Cut sets and the max cut problem, Math. Oper. Res. 12 (1987), 193–204.
J. Geelen, B. Gerards and G. Whittle: The highly-connected matroids in minorclosed classes, Ann. Comb. 19 (2015), 107–123.
C. D. Godsil: Algebraic Combinatorics, Chapman and Hall, New York, 1993.
D. R. Karger: Global min-cuts in RNC, and other ramifications of a simple mincut algorithm, in: Proc. 4th Annu. ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1993, 84–93.
D. R. Karger and C. Stein: A new approach to the minimum cut problem, J. ACM 43 (1996), 601–640.
L. Lovász: On determinants, matchings, and random algorithms, in: Fundamentals of Computation Theory (L. Budach, ed.), Akademie-Verlag, Berlin, 1979, 565–574.
K. Mulmuley, U. V. Vazirani and V. V. Vazirani: Matching is as easy as matrix inversion, in: Proc. STOC’ 87 Proceedings of the nineteenth annual ACM symposium on Theory of computing, ACM, New York, 1987, 345–354.
M. Mahajan, P. R. Subramanya and V. Vinay: The combinatorial approach yields an NC algorithm for computing Pfaffians, Discrete Appl. Math. 143 (2004), 1–16.
M. W. Padberg and M. R. Rao: Odd minimum cut-sets and b-matchings, Math. Oper. Res. 1 (1982), 67–80.
J. T. Schwartz: Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980), 701–717.
W. T. Tutte: The factorization of linear graphs, J. London Math. Soc. 21 (1947), 107–111.
A. Vardy: The intractability of computing the minimum distance of a code, IEEE Trans. Inform. Theory 43 (1997), 1757–1766.
R. Zippel: Probabilistic algorithms for sparse polynomials, in: Proc. EUROSAM 79 (Edward W. Ng, ed.), Lecture Notes in Compu. Sci. 72, Springer-Verlag, Berlin, 1979, 216–226.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by a grant from the Office of Naval Research [N00014-10-1-0851].
Rights and permissions
About this article
Cite this article
Geelen, J., Kapadia, R. Computing Girth and Cogirth in Perturbed Graphic Matroids. Combinatorica 38, 167–191 (2018). https://doi.org/10.1007/s00493-016-3445-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-016-3445-3