Parametric stable marriage and minimum cuts
- 13 March 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 30 (5) , 255-259
- https://doi.org/10.1016/0020-0190(89)90204-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An efficient algorithm for the “optimal” stable marriageJournal of the ACM, 1987
- The Complexity of Counting Stable MarriagesSIAM Journal on Computing, 1986
- A new approach to the maximum flow problemPublished by Association for Computing Machinery (ACM) ,1986
- Parametric Combinatorial Computing and a Problem of Program Module DistributionJournal of the ACM, 1983
- Critical Load Factors in Two-Processor Distributed SystemsIEEE Transactions on Software Engineering, 1978
- Mathematical Techniques for Efficient Record Segmentation in Large Shared DatabasesJournal of the ACM, 1976
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962