Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523)

From MaRDI portal
Revision as of 13:44, 1 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
Single machine precedence constrained scheduling is a Vertex cover problem
scientific article

    Statements

    Single machine precedence constrained scheduling is a Vertex cover problem (English)
    0 references
    0 references
    0 references
    0 references
    6 May 2009
    0 references
    0 references
    algorithms
    0 references
    scheduling
    0 references
    vertex cover
    0 references
    0 references
    0 references
    0 references
    0 references