The mutual exclusion scheduling problem for permutation and comparability graphs
- 1 January 2003
- journal article
- Published by Elsevier in Information and Computation
- Vol. 180 (2) , 71-81
- https://doi.org/10.1016/s0890-5401(02)00028-7
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Mutual exclusion schedulingTheoretical Computer Science, 1996
- Bounded vertex colorings of graphsDiscrete Mathematics, 1993
- On the complexity of scheduling incompatible jobs with unit-timesPublished by Springer Nature ,1993
- On improved time bounds for permutation graph problemsPublished by Springer Nature ,1993
- NP-Completeness of graph decomposition problemsJournal of Complexity, 1991
- The complexity of generalized clique packingDiscrete Applied Mathematics, 1985
- A note on the decomposition of graphs into isomorphic matchingsActa Mathematica Hungarica, 1983
- Partial orders of dimension 2Networks, 1972
- Optimal Sequencing of Two Equivalent ProcessorsSIAM Journal on Applied Mathematics, 1969
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964