The disjoint cliques problem

RAIRO Recherche Operationnelle

Volumn 31, Issue 1, 1997, Pages 45-66

  Jansen, Klaus ^a,b   Scheffler, Petra ^c   Woeginger, Gerhard ^d  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF TRIER   (Germany)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^d GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Cograph; Computational complexity; Directed path graph; Disjoint cliques; Interval graph; Partial k trees; Scheduling problem

Indexed keywords

EID: 5244265158     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro/1997310100451     Document Type: Article

References (19)

1. S. ARNBORG, Efficient algorithms for combinatorial problems on graphs with bounded decomposability. A survey, BIT, 1985, 25, pp. 2-23.
2. M. BELLARE, S. GOLDWASSER, C. LUND and A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximation, 25th ACM Symposium on the Theory of Computing, 1993, pp. 294-304.
3. M. W. BERN, E. L. LAWLER and A. L. R. WONG, Linear-time computations of subgraphs of decomposable graphs, Journal of Algorithms, 1987, 8, pp. 216-235.
4. H. L. BODLAENDER, A linear time algorithm for finding tree-decomposition of small treewidth, 25th Symposium on the Theory of Computing, 1993, pp. 226-234.
5. H. L. BODLAENDER, A tourist guide through treewidth, Acta Cybernetica, 1993, 11, pp. 1-23.
6. S. BOOTH and S. LUEKER, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. Syst. Sci., 1976, 73, pp. 335-379.
7. A. BRANDSTADT, Special graph classes - a survey. Report SM-DU-199, Universität-Gesamthochschule Duisburg. 1991.
8. D. G. CORNEIL, Y. PERL and L. K. STEWART, A linear recognition algorithm for cographs, SIAM J. Comput, 1985, 4, pp. 926-934.
9. P. F. DIETZ, Intersection graph algorithms, Ph. D. thesis, Comput. Sci. Dept., Cornell Univ., Ithaka, NY 1984.
10. A. FRANK, On chain and antichain families of a partially ordered set, J. Combinatorial Theory (B), 1980, 29, pp. 176-184.
11. M. R. GAREY and D. S. JOHNSON, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
12. F. GAVRIL, Algorithms for maximum k-colorings and k-coverings of transitive graphs, Networks, 1987, 17, pp. 465-470.
13. M. C. GOLUMBIC, Algorithm graph theory and perfect graphs. Academic Press, New York, 1980.
14. K. JANSEN, Scheduling of incompatible jobs on unrelated machines, International Journal of Foundations of Computer Science, 1993, 4, pp. 275-291.
15. C. LUND and M. YANNAKAKIS, On the hardness of approximating minimization problems, 25th ACM Symposium on the Theory of Computing, 1993, pp. 286-293.
16. S. MICALI and V. V. VAZIRANI, An O(√|V||E|) algorithm for finding maximum matchings in general graphs, in: Proc. 21st Ann. IEEE Symp. Foundations of Computer Science, Long Beach, California, 1980, pp. 17-27.
17. N. ROBERTSON and P. SEYMOUR, Graph Minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, 1986, 7, pp. 309-322.
18. P. SCHEFFLER, Die Baumweite von Graphen als Maß für die Kompliziertheit algorithmischer Probleme. Report RMATH-04/89, K-Weierstraß-Institut für Mathematik, Berlin, 1989.
19. M. YANNAKAKIS and F. GAVRIL, The maximum k-colorable subgraph problem for chordal graphs, Information Processing Letters, 1987, 24, pp. 133-137.