On the complexity of scheduling incompatible jobs with unit-times
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 291-300
- https://doi.org/10.1007/3-540-57182-5_21
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- Efficient algorithms for interval graphs and circular‐arc graphsNetworks, 1982
- Scheduling Interval-Ordered TasksSIAM Journal on Computing, 1979
- On a property of the class of n-colorable graphsJournal of Combinatorial Theory, Series B, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972