最大權(quán)匹配算法的改進與實現(xiàn)
IMPROVEMENT AND REALIZATION FOR THE MAXIMUM WEIGHT MATCHING ALGORITHM
-
摘要: 本文提出了有效關(guān)聯(lián)矩陣、升階鄰接矩陣、點的歸宿等一些新概念,對最大權(quán)匹配算法作了一些改進。上述方法已用FORTRAN語言編制成計算機程序,并在FELIX C-512機和IBM-PC機上調(diào)試通過,運行效果良好。
-
關(guān)鍵詞:
- 圖的最優(yōu)化算法; 最大權(quán)匹配; 升階鄰接矩陣; 歸宿矩陣
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.米涅卡著,李家瀅,趙關(guān)旗譯,網(wǎng)絡和圖的最優(yōu)化算法,中國鐵道出版社,1984. -
計量
- 文章訪問數(shù): 2107
- HTML全文瀏覽量: 135
- PDF下載量: 512
- 被引次數(shù): 0
下載:
