On the complexity of scheduling incompatible jobs with unit-times

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

Volumn 711 LNCS, Issue , 1993, Pages 291-300

  Bodlaender, Hans L ^a   Jansen, Klaus ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

GRAPH CLASS; MULTI PROCESSOR SYSTEMS; SCHEDULING PROBLEM; TIME LENGTH;

SCHEDULING;

EID: 84957663000     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57182-5_21     Document Type: Conference Paper

References (8)

1. Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal of Computing 4 (1985) 926-934
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
3. Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)
4. Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: Efficient algorithms for interval graphs and circular arc graphs. Networks 12 (1982) 459-467
5. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, Thatcher (eds.): Complexity of computer computations, Plenum Press (1972) 85-104
6. Lonc, Z.: On complexity of some chain and antichain partition problems. WG Conference, LNCS (1991) 97-104
7. Papadimitriou, C.H., Yannakakis, M.: Scheduling interval-ordered tasks. SIAM Journal of Computing 8 (1979) 405-409
8. Seinsche, D.: On a property of the class of n-colorable graphs. Journal of Combinatoral Theory B 16 (1974) 191-193