Skew partition sandwich problem is NP-complete (Q2840508)

From MaRDI portal
Revision as of 16:18, 6 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
Skew partition sandwich problem is NP-complete
scientific article

    Statements

    Skew partition sandwich problem is NP-complete (English)
    0 references
    19 July 2013
    0 references
    0 references
    graph theory
    0 references
    complexity
    0 references
    perfect graphs
    0 references
    graph decomposition
    0 references
    graph sandwich problems
    0 references
    0 references