Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 22:52, 30 January 2024

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