Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms (Q862816)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5118374
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms |
scientific article; zbMATH DE number 5118374 |
Statements
Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms (English)
0 references
24 January 2007
0 references
graph coloring
0 references
workforce planning
0 references
0.8612115979194641
0 references
0.842976987361908
0 references
0.7875046133995056
0 references
0.7612218856811523
0 references
0.7283616662025452
0 references
