Comparability graph augmentation for some multiprocessor scheduling problems (Q5961606)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparability graph augmentation for some multiprocessor scheduling problems |
scientific article; zbMATH DE number 981903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparability graph augmentation for some multiprocessor scheduling problems |
scientific article; zbMATH DE number 981903 |
Statements
Comparability graph augmentation for some multiprocessor scheduling problems (English)
0 references
21 April 1997
0 references
comparability graph
0 references
perfect graphs
0 references
0 references
0.7533318996429443
0 references
0.7510601282119751
0 references
