Xu Zhicai. IMPROVEMENT AND REALIZATION FOR THE MAXIMUM WEIGHT MATCHING ALGORITHM[J]. Journal of Electronics & Information Technology, 1988, 10(4): 305-315.
Citation:
Xu Zhicai. IMPROVEMENT AND REALIZATION FOR THE MAXIMUM WEIGHT MATCHING ALGORITHM[J]. Journal of Electronics & Information Technology, 1988, 10(4): 305-315.
Xu Zhicai. IMPROVEMENT AND REALIZATION FOR THE MAXIMUM WEIGHT MATCHING ALGORITHM[J]. Journal of Electronics & Information Technology, 1988, 10(4): 305-315.
Citation:
Xu Zhicai. IMPROVEMENT AND REALIZATION FOR THE MAXIMUM WEIGHT MATCHING ALGORITHM[J]. Journal of Electronics & Information Technology, 1988, 10(4): 305-315.
Some new concepts of efficient incidence matrix, ascending order adjacency matrix and vertex end-result are introduced, and some improvements of the maximum weight matching algorithm are made. With the method, the computer program in FORTRAN lagua-ge is realized on the computers FELIX C-512 and IBM-PC. Good results are obtained in practical operations.
J. Edmonds, Maximum Matching and a Polyhedron with 0.1-Vertices, J. of Reseasch of the National Bureau of Standards, 698(1965), 125-130.[2]E.米涅卡著,李家滢,赵关旗译,网络和图的最优化算法,中国铁道出版社,1984.
DownLoad: