The complexity of short schedules for uet bipartite graphs (Q4497865): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q398883 |
||
| Property / author | |||
| Property / author: Evripidis Bampis / rank | |||
Revision as of 13:06, 14 February 2024
scientific article; zbMATH DE number 1495349
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
