The necessary and sufficient condition for the worst-case male optimal stable matching

DOI10.1016/0020-0190(90)90132-HzbMath0702.68068OpenAlexW1983595791MaRDI QIDQ915462

R. T. Kuo, Shian-Shyong Tseng

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90132-h

zbMATH Keywords

sequential table matching algorithmworst-case execution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Stable matching with special preference patterns

Cites Work

• Unnamed Item
• A parallel algorithm to solve the stable marriage problem
• Worst-case choice for the stable marriage problem
• Three Fast Algorithms for Four Problems in Stable Marriage
• The Upper Bound for the Stable Marriage Problem
• An analysis of the stable marriage assignment algorithm
• College Admissions and the Stability of Marriage

This page was built for publication: The necessary and sufficient condition for the worst-case male optimal stable matching