Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064)

From MaRDI portal
Revision as of 14:13, 25 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
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
scientific article

    Statements

    Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (English)
    0 references
    0 references
    0 references
    20 December 2017
    0 references
    cubic graph
    0 references
    equitable coloring
    0 references
    NP-hardness
    0 references
    polynomial algorithm
    0 references
    scheduling
    0 references
    uniform machine
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references