The uniquely solvable bipartite matching problem

The uniquely solvable bipartite matching problem

0.00 Avg rating—0 Votes
Article ID: iaor1992261
Country: Netherlands
Volume: 10
Issue: 4
Start Page Number: 221
End Page Number: 224
Publication Date: Jun 1991
Journal: Operations Research Letters
Authors:
Abstract:

The bipartite cardinality matching problem can be solved by a well-known algorithm with complexity O(ℝEℝëℝVℝ1’/2). The paper gives 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.

Reviews

Required fields are marked *. Your email address will not be published.