Computing girth and cogirth in perturbed graphic matroids
From MaRDI portal
Publication:1747998
DOI10.1007/s00493-016-3445-3zbMath1413.05043arXiv1504.07647OpenAlexW2964104856MaRDI QIDQ1747998
Publication date: 27 April 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07647
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Linear codes (general theory) (94B05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Randomized algorithms (68W20)
Related Items (5)
Eulerian ideals ⋮ On the Complexity of Recovering Incidence Matrices ⋮ Blocking optimal arborescences ⋮ Blocking optimal structures ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Matching is as easy as matrix inversion
- A construction for binary matroids
- The combinatorial approach yields an NC algorithm for computing Pfaffians
- The highly connected matroids in minor-closed classes
- Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Odd Minimum Cut-Sets and b-Matchings
- A new approach to the minimum cut problem
- The intractability of computing the minimum distance of a code
- The Factorization of Linear Graphs
This page was built for publication: Computing girth and cogirth in perturbed graphic matroids
