Worst-case choice for the stable marriage problem (Q1063004): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(85)90104-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076296171 / rank | |||
Normal rank | |||
Revision as of 20:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case choice for the stable marriage problem |
scientific article |
Statements
Worst-case choice for the stable marriage problem (English)
0 references
1985
0 references
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.
0 references
worst-case choice
0 references
stable marriage problem
0 references
parallel algorithm
0 references
