Three procedures for the stable marriage problem
Communications of the ACM
An efficient algorithm for the “optimal” stable marriage
Journal of the ACM (JACM)
SIGCSE '92 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
On likely solutions of a stable matching problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Directed explicit model checking with HSF-SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Partial Order Reduction in Directed Model Checking
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
The stable marriage problem with restricted pairs
Theoretical Computer Science
Automatic extraction of dynamic record sections from search engine result pages
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Polynomial time algorithm for an optimal stable assignment with multiple partners
Theoretical Computer Science
Finding safety errors with ACO
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A unified approach to finding good stable matchings in the hospitals/residents setting
Theoretical Computer Science
Stable marriages with multiple partners: efficient search for an optimal solution
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The complexity of approximately counting stable matchings
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Adaptive stable marriage algorithms
Proceedings of the 48th Annual Southeast Regional Conference
The complexity of approximately counting stable matchings
Theoretical Computer Science
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
INFORMS Journal on Computing
Linear programming brings marital bliss
Operations Research Letters
Stable solutions vs. multiplicative utility solutions for the assignment problem
Operations Research Letters
Complexity of the resource allocation/matching problem with weight based ceilings
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
LinkedGeoData: A core for a web of spatial open data
Semantic Web - On linked spatiotemporal data and geo-ontologies
| Hi-index | 48.22 |
The original work of Gale and Shapley on an assignment method using the stable marriage criterion has been extended to find all the stable marriage assignments. The algorithm derived for finding all the stable marriage assignments is proved to satisfy all the conditions of the problem. Algorithm 411 applies to this paper.