ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Three procedures for the stable marriage problem
Full text PdfPdf (187 KB)
Source
Communications of the ACM archive
Volume 14 ,  Issue 7  (July 1971) table of contents
Pages: 491 - 492  
Year of Publication: 1971
ISSN:0001-0782
Authors
D. G. McVitie  Software Science Ltd., Wilmslow, Cheshire, England
L. B. Wilson  Univ. of Newcastle upon Tyne0, England
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 51,   Citation Count: 1
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/362619.362632
What is a DOI?

CITED BY
D. G. McVitie , L. B. Wilson, The stable marriage problem, Communications of the ACM, v.14 n.7, p.486-490, July 1971

INDEX TERMS

Keywords:
assignment problems, assignment procedures, combinatorics, discrete mathematics, operations research, stable marriage problem, university entrance

Collaborative Colleagues:
D. G. McVitie: colleagues
L. B. Wilson: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player