Computational complexity of stable partitions with b-preferences (Q1414457)

From MaRDI portal
Revision as of 20:09, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational complexity of stable partitions with b-preferences
scientific article

    Statements

    title
    Computational complexity of stable partitions with b-preferences (English)
    0 references
    DOI
    10.1007/s001820200124
    0 references
    author
    Jana Hajduková
    0 references
    Katarína Cechlárova
    0 references
    publication date
    23 November 2003
    0 references
    Mathematics Subject Classification ID
    91A12
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    2006728
    0 references
    zbMATH Keywords
    stable partitions
    0 references
    NP-completeness
    0 references
    OpenAlex ID
    W2313513701
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1414457&oldid=31474392"
    Powered by MediaWiki