Stable marriages by coroutines

DOI10.1016/0020-0190(83)90025-XzbMath0513.68064WikidataQ62654315 ScholiaQ62654315MaRDI QIDQ1050775

Lloyd Allison

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmstable marriagecoroutinesModula-2

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) General topics in the theory of software (68N01) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (3)

The average performance of a parallel stable mariage algorithm ⋮ A parallel algorithm to solve the stable marriage problem ⋮ Worst-case choice for the stable marriage problem

Uses Software

• Modula

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coroutines. A programming methodology, a language design and an implementation
• The SL5 procedure mechanism
• Stable marriage assignment for unequal sets
• An experiment in structured programming
• College Admissions and the Stability of Marriage

This page was built for publication: Stable marriages by coroutines