The average performance of a parallel stable mariage algorithm

DOI10.1007/BF02219230zbMath0677.68058OpenAlexW2035381225MaRDI QIDQ1123623

Shian-Shyong Tseng

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02219230

zbMATH Keywords

parallel algorithmaverage case analysisstable marriage

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Theory of software (68N99)

Related Items (2)

Almost stable matchings by truncating the Gale-Shapley algorithm ⋮ A neural network approach to solve the stable matching problem

Cites Work

• Unnamed Item
• A parallel algorithm to solve the stable marriage problem
• Stable marriages by coroutines
• Worst-case choice for the stable marriage problem
• Finding the maximum, merging, and sorting in a parallel computation model
• Parallelism in Comparison Problems
• Stable marriage assignment for unequal sets
• An analysis of the stable marriage assignment algorithm
• College Admissions and the Stability of Marriage

This page was built for publication: The average performance of a parallel stable mariage algorithm