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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2008.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015939796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fixed point approach for stable networks and stable marriages / 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: Three Fast Algorithms for Four Problems in Stable Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Access and Alignment of Data in an Array Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Stable Matching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm to solve the stable marriage problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:26, 1 July 2024

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
    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

    Identifiers