The stable marriage problem with restricted pairs

Theoretical Computer Science

Volumn 306, Issue 1-3, 2003, Pages 391-405

  Dias, Vânia M F ^a   Da Fonseca, Guilherme D ^b   De Figueiredo, Celina M H ^b   Szwarcfiter, Jayme L ^b  

^a STATE UNIVERSITY OF LONDRINA   (Brazil)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Algorithms; Forbidden pairs; Forced pairs; Rotations; Stable marriage

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE;

FORCED PAIRS;

PROBLEM SOLVING;

EID: 0042389773     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00319-0     Document Type: Article

References (9)

1. V.M.F. Dias, Stable matchings with restricted pairs, Master dissertation, COPPE, Universidade Federal do Rio de Janeiro, 2000 (in Portuguese).
2. G.D. da Fonseca, Stable marriages with forbidden pairs, Graduation dissertation, Instituto de Matemática, Universidade Federal do Rio de Janeiro, 2000 (in Portuguese).
3. Gale D., Shapley L. College admissions and the stability of marriage. Amer. Math. Monthly. 69:1962;9-15.
4. Gusfield D. Three fast algorithms for four problems in stable marriage. SIAM J. Comput. 16:1987;111-128.
5. Gusfield D., Irving R.W. The Stable Marriage Problem - Structure and Algorithms. 1989;The MIT Press, Cambridge, MA.
6. Habib M., Medina R., Nourine L., Steiner G. Efficient algorithms on distributive lattices. Discrete Appl. Math. 110:2001;169-187.
7. Irving R.W., Leather P. The complexity of counting stable marriages. SIAM J. Comput. 15:1986;654-667.
8. D.E. Knuth, Stable Marriage and its Relation to Other Combinatorial Problems, American Mathematical Society, Providence, RI, 1997.
9. McVitie D., Wilson L. The stable marriage problem. Comm. ACM. 14:1971;486-490.