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 条
  • [41] A FRAMEWORK FOR MINIMAL HEREDITARY CLASSES OF GRAPHS OF UNBOUNDED CLIQUE-WIDTH
    Brignall, R.
    Cocks, D.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (04) : 2558 - 2584
  • [42] Infinitely many minimal classes of graphs of unbounded clique-width
    Collins, A.
    Foniok, J.
    Korpelainen, N.
    Lozin, V.
    Zamaraev, V.
    DISCRETE APPLIED MATHEMATICS, 2018, 248 : 145 - 152
  • [43] The densest k-subgraph problem on clique graphs
    Liazi, Maria
    Milis, Ioannis
    Pascual, Fanny
    Zissimopoulos, Vassilis
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (04) : 465 - 474
  • [44] The tree- and clique-width of bipartite graphs in special classes
    Lozin, V. V.
    Rautenbach, D.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2006, 34 : 57 - 67
  • [45] Complexity and heuristics for the weighted max cut-clique problem
    Bourel, Mathias
    Canale, Eduardo
    Robledo, Franco
    Romero, Pablo
    Stabile, Luis
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (02) : 908 - 928
  • [46] A heuristic approach for the max-min diversity problem based on max-clique
    Della Croce, Federico
    Grosso, Andrea
    Locatelli, Marco
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (08) : 2429 - 2433
  • [47] Coordinated graphs and clique graphs of clique-Helly perfect graphs
    Bonomo, Flavia
    Duran, Guillermo
    Groshaus, Marina
    UTILITAS MATHEMATICA, 2007, 72 : 175 - 191
  • [48] AN EXTENSION OF THE CONCEPT OF CLIQUE GRAPHS AND THE PROBLEM OF K-CONVERGENCE TO SIGNED GRAPHS
    ACHARYA, BD
    NATIONAL ACADEMY SCIENCE LETTERS-INDIA, 1980, 3 (08): : 239 - 242
  • [49] On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
    Keller, Chaya
    Smorodibsky, Shankhar
    Tardos, Gabor
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2254 - 2263
  • [50] ISOMORPHISM-PROBLEM FOR CLASSES OF GRAPHS
    PONOMARENKO, IN
    DOKLADY AKADEMII NAUK SSSR, 1989, 304 (03): : 552 - 556
12345