On the (co)girth of a connected matroid

DOI10.1016/j.dam.2007.06.015zbMath1127.05020OpenAlexW2106233458WikidataQ56048455 ScholiaQ56048455MaRDI QIDQ2462384

Yanyan Li

Publication date: 30 November 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.06.015

zbMATH Keywords

girthmatroid connectivitycogirth

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

Computing the largest bond and the maximum connected cut of a graph ⋮ The Distributions of Functions Related to Parametric Integer Optimization ⋮ Sparse Solutions of Linear Diophantine Equations ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Sensor networks: from dependence analysis via matroid bases to online synthesis

Uses Software

• PaToH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on hyperplane generation
• Robust estimation in structured linear regression
• Partitioning mathematical programs for parallel solution
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• Matroid Applications and Algorithms
• The intractability of computing the minimum distance of a code
• Sensor network design for fault tolerant estimation
• Permuting Sparse Rectangular Matrices into Block-Diagonal Form
• On the Complexity of Some Enumeration Problems for Matroids

This page was built for publication: On the (co)girth of a connected matroid