Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (Q1018085)

From MaRDI portal
Revision as of 14:26, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties
scientific article

    Statements

    Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (English)
    0 references
    0 references
    0 references
    13 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    stable matching problem
    0 references
    stable marriage problem
    0 references
    interconnection networks
    0 references
    multi-stage interconnection networks
    0 references
    stability
    0 references
    unstability
    0 references
    path-length
    0 references
    preference lists
    0 references
    optimal pairs
    0 references
    ties
    0 references
    0 references