Middendorf, M.; Pfeiffer, F. The max clique problem in classes of string-graphs. (English) Zbl 0764.68129 Discrete Math. 108, No. 1-3, 365-372 (1992). Summary: 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. Cited in 2 ReviewsCited in 19 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 05C85 Graph algorithms (graph-theoretic aspects) 68Q25 Analysis of algorithms and problem complexity Keywords:string-graph; intersection graph; max clique problem; NP-completeness; polynomial time algorithms PDFBibTeX XMLCite \textit{M. Middendorf} and \textit{F. Pfeiffer}, Discrete Math. 108, No. 1--3, 365--372 (1992; Zbl 0764.68129) Full Text: DOI References: [1] Ehrlich, S.; Even, S.; Tarjan, R. E., Intersection graphs of curves in the plane, J. Combin. Theory Ser. B, 21, 8-20 (1976) · Zbl 0348.05113 [2] Garey, M. R.; Johnson, D. S., Computers and Intractability (1978), Freeman: Freeman New York · Zbl 0379.68035 [3] Kratochvil, J.; Goljan, M.; Kuc̆era, P., String Graphs (1986), Academia: Academia Praha · Zbl 0607.05031 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.