The uniquely solvable bipartite matching problem

DOI10.1016/0167-6377(91)90062-TMaRDI QIDQ1178733zbMATH OpenFDO

Authors Katarina Cechlárová

Publication date 26 June 1992

Published in Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

bipartite graphslinear time algorithmbipartite cardinality matchingunique maximum matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the Bipartite Unique Perfect Matching Problem
• On the uniqueness of perfect matchings in bipartite graphs
• On the maximum uniquely restricted matching for bipartite graphs
• Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching
• Solving matching problems efficiently in bipartite graphs
• Approximating maximum uniquely restricted matchings in bipartite graphs
• On the uniqueness and numerical approximations for a matching problem
• Bipartite matching and Van der Waerden conjecture
• Constrained matching problems in bipartite graphs
• An efficient algorithm for the bipartite matching problem

Cites work

• scientific article; zbMATH DE number 3837387 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Matching theory

Cited in

(9)

• Unlabeled sample compression schemes and corner peelings for ample and maximum classes
• Persistency in maximum cardinality bipartite matchings
• A polynomial time solvable instance of the feasible minimum cover problem
• On \(\alpha\)-critical edges in König--Egerváry graphs
• Trapezoidal matrices and the bottleneck assignment problem
• On the Bipartite Unique Perfect Matching Problem
• Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs
• Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching
• scientific article; zbMATH DE number 842126 (Why is no real title available?)

This page was built for publication: The uniquely solvable bipartite matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178733)