The uniquely solvable bipartite matching problem

DOI10.1016/0167-6377(91)90062-TzbMath0741.90078MaRDI QIDQ1178733

Katarína Cechlárova

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) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

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 ⋮ Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs ⋮ On \(\alpha\)-critical edges in König--Egerváry graphs ⋮ Trapezoidal matrices and the bottleneck assignment problem

Cites Work

• Matching theory
• Unnamed Item
• Unnamed Item

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