Elsevier

Discrete Mathematics

Volume 108, Issues 1–3, 28 October 1992, Pages 365-372
Discrete Mathematics

The max clique problem in classes of string-graphs☆

https://doi.org/10.1016/0012-365X(92)90688-CGet rights and content
Under an Elsevier user license
open archive

Abstract

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 by (0)

☆

Supported by Sonderforschungsbereich 303 (DFG).

Copyright © 1992 Published by Elsevier B.V.