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 条
12345