Complexity of the sex-equal stable marriage problem (Q689901): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every finite distributive lattice is a set of stable matchings / 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: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every finite distributive lattice is a set of stable matchings for a small stable marriage instance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of stable matchings as extreme points of a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming brings marital bliss / rank
 
Normal rank

Latest revision as of 11:44, 22 May 2024

scientific article
Language Label Description Also known as
English
Complexity of the sex-equal stable marriage problem
scientific article

    Statements

    Complexity of the sex-equal stable marriage problem (English)
    0 references
    0 references
    13 March 1994
    0 references
    polynomial transformation
    0 references
    NP-complete
    0 references
    ideal weight
    0 references
    sex-equal stable marriage
    0 references
    NP-hard
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references