An identity for matching and skew-symmetric determinant

DOI10.1016/0024-3795(93)00149-TzbMath0823.05045MaRDI QIDQ1805187

Kazuo Murota

Publication date: 24 October 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

polytopesskew-symmetric matrixperfect matchingintegralityblossom

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

An identity for bipartite matching and symmetric determinant ⋮ Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form

Cites Work

• Short proofs on the matching polyhedron
• Matching theory
• Systems analysis by graphs and matroids. Structural solvability and controllability
• An identity for bipartite matching and symmetric determinant
• Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation
• Computing the Degree of Determinants via Combinatorial Relaxation
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An identity for matching and skew-symmetric determinant