The max clique problem in classes of string-graphs
type: Item
instance of: scholarly article
title: The max clique problem in classes of string-graphs
zbMATH Open document ID: 0764.68129
DOI: 10.1016/0012-365X(92)90688-C
published in: Discrete Mathematics
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 97515
zbMATH Keywords: string-graph
zbMATH Keywords: intersection graph
zbMATH Keywords: max clique problem
zbMATH Keywords: NP-completeness
zbMATH Keywords: polynomial time algorithms
author: Matthias Middendorf
author: Frank Pfeiffer
MaRDI profile type: Publication
cites work: Intersection graphs of curves in the plane
cites work: `` Strong '' NP-Completeness Results
cites work: Q3745859
description: scientific article; zbMATH DE number 97515