Improvement and realization for the maximum weight matching algorithm
Some new concepts of effective incidence matrix, ascending order adjacency matrix and end-result vertex are introduced, and some improvements of the maximum weight matching algorithm are made. With this method a computer program in FORTRAN language is realized on the computers FELIX C-512 and IBM-PC. Good results are obtained in practical operations.
Key wordsOptimization algorithm for graph Maximum weight matching Ascending order adjacency matrix End-result matrix
Unable to display preview. Download preview PDF.