The uniquely solvable bipartite matching problem

Authors:
Katarína Cechlárová
Affiliations:
Department of Geometry and Algebra, P.J. afárik's University, Jesenná 5, 041 54 Koice, Czechoslovakia
Venue:
Operations Research Letters
Year:
1991

Citing 2
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Efficient Algorithms for Finding Maximal Matching in Graphs

CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming

Persistency in maximum cardinality bipartite matchings

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The bipartite cardinality matching problem can be solved by a well-known algorithm with complexity O(| E | . | V |^1^2). We give a characterization of the bipartite graphs with a unique maximum matching and an O(| E |) algorithm for both recognizing these graphs and producing the unique matching, when it exists.