A sublinear parallel algorithm for stable matching
Tomás Feder, Nimrod Megiddo, Serge A. Plotkin · Symposium on Discrete Algorithms · 1994
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 0*(Jiii) time by a polynomial number of processors, where nz is the total length of preference lists of individuals. @ 2000 Published by Elsevier Sciencc B.V. All rights reserved.