Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306)
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: Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable |
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
