On complexity of some chain and antichain partition problems

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

Volumn 570 LNCS, Issue , 1992, Pages 97-104

  Lone, Zbigniew ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

ANTICHAIN; INTERVAL ORDERS; K ELEMENTS; NP COMPLETE; ORDERED SET; PARTITION PROBLEM;

GRAPH THEORY;

EID: 84957688986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55121-2_9     Document Type: Conference Paper

References (8)

1. Corneil D. G., The complexity of generalized clique packing, Discrete Applied Mathematics 12(1985), 233-239.
2. Grötschel M., Lovász L. and Schrijver A., The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1(1981), 169-197.
3. Möhring R.H., Algorithmic aspects of comparability graphs and interval graphs, in Graphs and Order (ed. I. Rival), Reidel Publishing Co., Dordrecht 1985, 41-102.
4. Möhring R.H., Computationally tractable classes of ordered sets, in Algorithms and Order (ed. I. Rival), Reidel Publishing Co., Dordrecht 1989, 105-194.
5. Möhring R.H., Problem 9.10, in Graphs and Order (ed. I. Rival), Reidel Publishing Co., Dordrecht 1985, 583.
6. Papadimitriou C.H. and Yanakakis M., Scheduling interval-ordered tasks, SIAM J. Comp. 8(1979), 405-409.
7. Reuter K., The jump number and the lattice of maximal antichains, Report 1197, Technische Hochschule Darmstadt, 1-16.
8. Rival I., Some order theoretical ideas about scheduling, IX symposium on operations research (Osnabrück, 1984), Methods of Operations Research 49 (1985).