Interval Vertex-Coloring of a Graph With Forbidden Colors
- 1 January 1989
- book chapter
- Published by Elsevier BV
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- The complexity of scheduling independent two-processor tasks on dedicated processorsInformation Processing Letters, 1987
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline IntervalsOperations Research, 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1983
- Scheduling unit-time tasks with integer release times and deadlinesInformation Processing Letters, 1983
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976