The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984)

From MaRDI portal
Revision as of 13:36, 13 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of scheduling independent two-processor tasks on dedicated processors
scientific article

    Statements

    The complexity of scheduling independent two-processor tasks on dedicated processors (English)
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    edge coloring
    0 references
    NP-completeness
    0 references
    two-processor task scheduling
    0 references