Worst-case choice for the stable marriage problem
From MaRDI portal
(Redirected from Publication:1063004)
We present a worst-case choice for the stable marriage problem which takes the maximum number of stages for \textit{D. Gale} and \textit{L. S. Shapely}'s algorithm [Amer. Math. Monthly 69, 9-15 (1962; Zbl 0109.244)]. We also analyze a coroutine solution recently suggested by \textit{L. Allison} [Inf. Process. Lett. 16, 61-65 (1983; Zbl 0513.68064)] as well as a parallel algorithm for this problem.
Recommendations
Cites work
Cited in
(6)- Comment on worst-case choice for the stable marriage problem
- The average performance of a parallel stable mariage algorithm
- A neural network approach to solve the stable matching problem
- scientific article; zbMATH DE number 6672022 (Why is no real title available?)
- A parallel algorithm to solve the stable marriage problem
- The necessary and sufficient condition for the worst-case male optimal stable matching
This page was built for publication: Worst-case choice for the stable marriage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063004)