Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427)

From MaRDI portal
Revision as of 06:16, 10 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q175575)
scientific article
Language Label Description Also known as
English
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
scientific article

    Statements

    Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2022
    0 references
    stable matching
    0 references
    fixed-parameter tractability
    0 references
    W[1]-hardness
    0 references
    tree-cut width
    0 references
    disjoint path modulator
    0 references

    Identifiers