Mutual exclusion scheduling
Authors:
- Brenda S BakerBBBrenda S Baker
- Edward G CoffmanECEdward G Coffman
- 1 August 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 162 (2) , 225-243
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Restrictions of graph partition problems. Part ITheoretical Computer Science, 1995
- Scheduling with incompatible jobsDiscrete Applied Mathematics, 1994
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Parallel domain decomposition applied to coupled transport equations1994
- On the hardness of approximating minimization problems1993
- Restrictions of Graph Partition Problems1993
- A better performance guarantee for approximate graph coloringAlgorithmica, 1990
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- An upper bound for the chromatic number of a graph and its application to timetabling problemsThe Computer Journal, 1967