Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10951-012-0291-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10951-012-0291-Z / rank | |||
Normal rank | |||
Latest revision as of 14:58, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable |
scientific article |
Statements
Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (English)
0 references
5 February 2014
0 references
shared resource scheduling
0 references
scheduling with conflict
0 references
maximum degree colouring
0 references
0 references
0 references
