Worst-case choice for the stable marriage problem

DOI10.1016/0020-0190(85)90104-8zbMath0574.05039OpenAlexW2076296171MaRDI QIDQ1063004

Mukkai S. Krishnamoorthy, Deepak Kapur

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90104-8

zbMATH Keywords

parallel algorithmstable marriage problemworst-case choice

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)

Related Items (4)

Comment on worst-case choice for the stable marriage problem ⋮ The average performance of a parallel stable mariage algorithm ⋮ The necessary and sufficient condition for the worst-case male optimal stable matching ⋮ A neural network approach to solve the stable matching problem

Cites Work

• Stable marriages by coroutines
• Stable marriage assignment for unequal sets
• College Admissions and the Stability of Marriage
• Unnamed Item
• Unnamed Item

This page was built for publication: Worst-case choice for the stable marriage problem