最大权匹配算法的改进与实现
IMPROVEMENT AND REALIZATION FOR THE MAXIMUM WEIGHT MATCHING ALGORITHM
-
摘要: 本文提出了有效关联矩阵、升阶邻接矩阵、点的归宿等一些新概念,对最大权匹配算法作了一些改进。上述方法已用FORTRAN语言编制成计算机程序,并在FELIX C-512机和IBM-PC机上调试通过,运行效果良好。Abstract: 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. -
计量
- 文章访问数: 2100
- HTML全文浏览量: 133
- PDF下载量: 512
- 被引次数: 0
下载:
