The average performance of a parallel stable mariage algorithm

DOI10.1007/BF02219230MaRDI QIDQ1123623zbMATH OpenOpenAlexFDO

Authors 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

average case analysisparallel algorithmstable marriage

Mathematics Subject Classification ID

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

Recommendations

• A parallel algorithm to solve the stable marriage problem
• scientific article; zbMATH DE number 1003296
• A sublinear parallel algorithm for stable matching
• Worst-case choice for the stable marriage problem
• An efficient algorithm for the “stable roommates” problem

Cites work

• A parallel algorithm to solve the stable marriage problem
• An analysis of the stable marriage assignment algorithm
• College Admissions and the Stability of Marriage
• Finding the maximum, merging, and sorting in a parallel computation model
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Parallelism in Comparison Problems
• Stable marriage assignment for unequal sets
• Stable marriages by coroutines
• Worst-case choice for the stable marriage problem

Cited in

(6)

• A neural network approach to solve the stable matching problem
• A sublinear parallel algorithm for stable matching
• Almost stable matchings by truncating the Gale-Shapley algorithm
• scientific article; zbMATH DE number 1003296 (Why is no real title available?)
• High Performance Computing - HiPC 2003
• A parallel algorithm to solve the stable marriage problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123623)