论文信息 - A sublinear parallel algorithm for stable matching

A sublinear parallel algorithm for stable matching

Abstract 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.

Nimrod Megiddo | Tomás Feder | Serge A. Plotkin

[1] Ernst W. Mayr,et al. The Complexity of Circuit Value and Network Stability , 1992, J. Comput. Syst. Sci..

[2] Donald E. Knuth,et al. Stable Networks and Product Graphs , 1995 .

[3] Martin Dyer,et al. The Stable Marriage Problem: Structure and Algorithms , 1991 .

[4] Shinji Mizuno,et al. A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..

[5] Ernst W. Mayr,et al. The complexity of circuit value and network stability , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[6] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..

[7] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .

[8] Ashok Subramanian,et al. A New Approach to Stable Matching Problems , 1989, SIAM J. Comput..

[9] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[10] Andrew V. Goldberg,et al. Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems , 1992, SIAM J. Comput..