M.F. Cowlishaw
IBM Systems Journal
A parallel algorithm for the stable matching problem is presented. The algorithm is based on the primal-dual interior path-following method for linear programming. The main result is that a stable matching can be found in O*(√m) time by a polynomial number of processors, where m is the total length of preference lists of individuals. © 2000 Published by Elsevier Science B.V. All rights reserved.
M.F. Cowlishaw
IBM Systems Journal
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Thomas M. Cover
IEEE Trans. Inf. Theory
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design