Primal-dual Algorithms for Max-weight Perfect Matching
Ren Jing · Journal of Jiamusi University · 2008
In this paper,the detail and algorithms for maximum weight perfect matching in a complete weighted bipartite,G=(X,Y,E,ω),ω≥0,|X|=|Y|=n,were studied.The main methods are complementaryslacknessa theorem and primal-dual algorithms.