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 条
  • [21] A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs
    Luciano Porretta
    Daniele Catanzaro
    Bjarni V. Halldórsson
    Bernard Fortz
    4OR, 2019, 17 : 75 - 96
  • [22] The Maximum Clique Problem for Permutation Hamming Graphs
    János Barta
    Roberto Montemanni
    Journal of Optimization Theory and Applications, 2022, 194 : 492 - 507
  • [23] Solving the Maximal Clique Problem on Compressed Graphs
    Bernard, Jocelyn
    Seba, Hamida
    FOUNDATIONS OF INTELLIGENT SYSTEMS (ISMIS 2018), 2018, 11177 : 45 - 55
  • [24] The Maximum Clique Problem in Multiple Interval Graphs
    Francis, Mathew C.
    Goncalves, Daniel
    Ochem, Pascal
    ALGORITHMICA, 2015, 71 (04) : 812 - 836
  • [25] The Maximum Clique Problem in Multiple Interval Graphs
    Mathew C. Francis
    Daniel Gonçalves
    Pascal Ochem
    Algorithmica, 2015, 71 : 812 - 836
  • [26] The clique problem in intersection graphs of ellipses and triangles
    Ambühl, C
    Wagner, U
    THEORY OF COMPUTING SYSTEMS, 2005, 38 (03) : 279 - 292
  • [27] The Clique Problem in Intersection Graphs of Ellipses and Triangles
    Christoph Ambühl
    Uli Wagner
    Theory of Computing Systems, 2005, 38 : 279 - 292
  • [28] The Maximum Clique Problem for Permutation Hamming Graphs
    Barta, Janos
    Montemanni, Roberto
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2022, 194 (02) : 492 - 507
  • [29] On CLIQUE Problem for Sparse Graphs of Large Dimension
    Bykova, Valentina
    Illarionov, Roman
    INFORMATION TECHNOLOGIES AND MATHEMATICAL MODELLING, 2014, 487 : 69 - 75
  • [30] A generalization of chordal graphs and the maximum clique problem
    Chmeiss, A
    Jegou, P
    INFORMATION PROCESSING LETTERS, 1997, 62 (02) : 61 - 66
12345