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.
参考文献
相似文献
引证文献
引用本文
谢政,陈浩光.赋双权二部图中最大权最小权完美匹配[J].国防科技大学学报,1994,16(4):98-101. Xie Zheng, Chen Haoguang. A Max-min Weight Perfect Matching in Bipartite Graph with Two Edge Weights[J]. Journal of National University of Defense Technology,1994,16(4):98-101.