THE MAX CLIQUE PROBLEM IN CLASSES OF STRING-GRAPHS

被引：20
|
作者：
MIDDENDORF, M
PFEIFFER, F
机构：
[1] Institut für Operations Research, Universität Bonn, W-5300 Bonn 1
来源：
DISCRETE MATHEMATICS | 1992年 / 108卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(92)90688-C
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A string-graph is an intersection graph of a set of curves in the plane. Investigating the complexity of the max clique problem for some classes of string-graphs we obtain NP-completeness results on one hand and polynomial time algorithms on the other hand for string-graph-classes of at first sight surprising similarity.
引用
收藏
页码：365 / 372
页数：8
相关论文
共 50 条
  • [1] Edge clique graphs and some classes of chordal graphs
    Discrete Math, 1-3 (31-39):
  • [2] Edge clique graphs and some classes of chordal graphs
    Cerioli, MR
    Szwarcfiter, JL
    DISCRETE MATHEMATICS, 2002, 242 (1-3) : 31 - 39
  • [3] EDGE CLIQUE GRAPHS OF SOME IMPORTANT CLASSES OF GRAPHS
    RAYCHAUDHURI, A
    ARS COMBINATORIA, 1991, 32 : 269 - 278
  • [4] THE CLIQUE PROBLEM FOR PLANAR GRAPHS
    PAPADIMITRIOU, CH
    YANNAKAKIS, M
    INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 131 - 133
  • [5] A NOTE ON THE APPROXIMATION OF THE MAX CLIQUE PROBLEM
    CRESCENZI, P
    FIORINI, C
    SILVESTRI, R
    INFORMATION PROCESSING LETTERS, 1991, 40 (01) : 1 - 5
  • [6] On the clique-width of graphs in hereditary classes
    Boliac, R
    Lozin, V
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 44 - 54
  • [7] The Clique Problem in Ray Intersection Graphs
    Cabello, Sergio
    Cardinal, Jean
    Langerman, Stefan
    ALGORITHMS - ESA 2012, 2012, 7501 : 241 - 252
  • [8] The Clique Problem in Ray Intersection Graphs
    Cabello, Sergio
    Cardinal, Jean
    Langerman, Stefan
    DISCRETE & COMPUTATIONAL GEOMETRY, 2013, 50 (03) : 771 - 783
  • [9] HARD GRAPHS FOR THE MAXIMUM CLIQUE PROBLEM
    HOEDE, C
    DISCRETE MATHEMATICS, 1988, 72 (1-3) : 175 - 179
  • [10] On the clique problem in intersection graphs of ellipses
    Ambühl, C
    Wagner, U
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 489 - 500
12345