Worst-case choice for the stable marriage problem (Q1063004): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Stable marriages by coroutines / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable marriage assignment for unequal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3311639 / rank
 
Normal rank

Latest revision as of 17:51, 14 June 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
    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

    Identifiers