The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065)

From MaRDI portal
Revision as of 10:22, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
The clique problem with multiple-choice constraints under a cycle-free dependency graph
scientific article

    Statements

    The clique problem with multiple-choice constraints under a cycle-free dependency graph (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2020
    0 references
    clique problem
    0 references
    multiple-choice constraints
    0 references
    perfect graph
    0 references
    convex-hull description
    0 references
    scheduling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references