The complexity of short schedules for uet bipartite graphs (Q4497865)
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: The complexity of short schedules for uet bipartite graphs |
scientific article; zbMATH DE number 1495349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of short schedules for uet bipartite graphs |
scientific article; zbMATH DE number 1495349 |
Statements
The complexity of short schedules for uet bipartite graphs (English)
0 references
24 August 2000
0 references
schedule
0 references
multiprocessor
0 references
bipartite graph
0 references
complexity
0 references
multiprocessor scheduling problem
0 references
0.8496879
0 references
0.84558046
0 references
0.84269345
0 references
0.8391344
0 references
0.8365346
0 references
0.83561254
0 references
0.8346883
0 references
0.83008814
0 references
