On the graphic matroid parity problem
From MaRDI portal
Publication:1400959
DOI10.1016/S0095-8956(02)00045-XzbMath1029.05027MaRDI QIDQ1400959
Publication date: 17 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items
Optimal hierarchical clustering on a graph ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ Algebraic Algorithms for Linear Matroid Parity Problems ⋮ 1.61-approximation for min-power strong connectivity with two power levels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching theory
- Matroid matching and some applications
- Graph factors
- Matroid theory and its applications in electric network theory and in statics
- Über die Maximalzahl kreuzungsfreier H-Wege
- Perfect matchings of a graph
- Complexity of Matroid Property Algorithms
- A new characterization of the maximum genus of a graph
- Paths, Trees, and Flowers