A Max-min Weight Perfect Matching in Bipartite Graph with Two Edge Weights
DOI:
CSTR:
Author:
Affiliation:
Clc Number:
Fund Project:
Article
|
Figures
|
Metrics
|
Reference
|
Related
|
Cited by
|
Materials
|
Comments
Abstract:
In this paper, we built a network model of max-min weight perfect matching in the bipartite graph with two edge weights,and give an efficient algorithm for it. Lastly, we solve a particular assignment problem.
