An identity for bipartite matching and symmetric determinant

DOI10.1016/0024-3795(93)00300-OzbMath0823.05046OpenAlexW2082996995MaRDI QIDQ1894478

Kazuo Murota

Publication date: 23 October 1995

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

Full work available at URL: https://doi.org/10.1016/0024-3795(93)00300-o

zbMATH Keywords

perfect matchingintegralitybipartite matching polytopessymmetric polynomials matrix

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 (3)

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

Cites Work

• Matching theory
• Systems analysis by graphs and matroids. Structural solvability and controllability
• An identity for matching and skew-symmetric determinant
• Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation
• Computing the Degree of Determinants via Combinatorial Relaxation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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