The mutual exclusion scheduling problem for permutation and comparability graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1373 LNCS, Issue , 1998, Pages 287-297

  Jansen, Klaus ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPARABILITY GRAPHS; MUTUAL EXCLUSIONS; NP COMPLETE; OPEN PROBLEMS; PERMUTATION GRAPH; SCHEDULING PROBLEM; UNDIRECTED GRAPH;

COMPUTER SCIENCE; SCHEDULING;

GRAPHIC METHODS;

EID: 35048882786     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028568     Document Type: Conference Paper

References (23)

1. N. Alon: A note on the decomposition of graphs into isomorphic matchings, Acta Mathematica Hungarica 42 (1983), 221-223.
2. B.S. Baker and E.G. Coffman: Mutual exclusion scheduling, Theoretical Computer Science 162 (1996), 225-243.
3. K.A. Baker, P.C. Fishburn and F.S. Roberts: Partial orders of dimension 2, Networks 2 (1971), 11-28.
4. M. Bartusch, R.H. Möhring and F.J. Radermacher: M-machine unit time scheduling: A report on ongoing research, in: Optimization, Parallel Processing and Applications (ed. A. Kurzhanski), LNEMS 304, 1988, 165-213.
5. P. Bjorstad, W.M. Coughran and E. Grosse: Parallel domain decomposition applied to coupled transport equations, in: Domain Decomposition Methods in Scientific and Engineering Computing (eds. D.E. Keys, J. Xu), AMS, Providence, 1995, 369-380.
6. J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt and J. Weglarz: Scheduling computer and manufacturing processes, Springer, Heidelberg, 1996.
7. H.L. Bodlaender and K. Jansen: On the complexity of scheduling incompatible jobs with unit-times, Mathematical Foundations of Computer Science, MFCS 93, LNCS 711, 291-300.
8. A. Brandstädt: On improved time bounds for permutation graph problems, Graph Theoretic Concepts in Computer Science, WG 92, LNCS 657, 1-10.
9. E. Cohen and M. Tarsi: NP-completeness of graph decomposition problem, Journal of Complexity 7 (1991), 200-212.
10. D.G. Corneil: The complexity of generalized clique packing, Discrete Applied Mathematics 12 (1985), 233-239.
11. M.R. Garey and D.S. Johnson: Computers and Intractability: A Guide to the Theorey of NP-Completeness, Freeman, New York, 1979.
12. P.C. Gilmore and A.J. Hoffman: A characterization of comparability graphs and of interval graphs, Canadian Journal of Mathematics 16 (1964), 539-548.
13. P. Hansen, A. Hertz and J. Kuplinsky: Bounded vertex colorings of graphs, Discrete-Mathematics 111 (1993), 305-312.
14. S. Irani and V. Leung: Scheduling with conflicts, and applications to traffic signal control, SIAM Symposium on Discrete Algorithms, SODA 96, 85-94.
15. t - coloring problem, Symposium on Theoretical Aspects of Computer Science, STACS 95, LNCS 900, 409-420.
16. F. Kitagawa and H. Ikeda: An existential problem of a weight - controlled subset and its application to school time table construction, Discrete Mathematics 72 (1988), 195-211.
17. V. Lofti and S. Sarin: A graph coloring algorithm for large scale scheduling problems, Computers and Operations Research 13 (1986), 27-32. (Pubitemid 16587702)
18. Z. Lonc: On complexity of some chain and antichain partition problem, Graph Theoretical Concepts in Computer Science, WG 91, LNCS 570, 97-104.
19. R.H. Möhring: Algorithmic aspects of comparability graphs and interval graphs, in: Graphs and Orders (ed. I. Rival), Reidel Publishing, Dordrecht 1985, 41-101.
20. R.H. Möhring: Problem 9.10, in: Graphs and Orders (ed. I. Rival), Reidel Publishing, Dordrecht 1985, 583.
21. R.H. Möhring: Computationally tractable classes of ordered sets, in: Algorithms and Orders (ed. I. Rival), Kluwer Acad. Publishing, Dordrecht 1989, 105-193.
22. A. Pnueli, A. Lempel and W. Even: Transitive orientation of graphs and identification of permutation graphs, Canadian Journal of Mathematics 23 (1971), 160-175.
23. K. Wagner: Monotonic coverings of finite sets, Journal of Information Processing and Cybernetics - EIK 20 (1984), 633-639.