Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms (Q862816)

From MaRDI portal
Revision as of 01:20, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms
scientific article

    Statements

    Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms (English)
    0 references
    0 references
    0 references
    24 January 2007
    0 references
    graph coloring
    0 references
    workforce planning
    0 references

    Identifiers

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