Finding maximum cliques on circular-arc graphs
type: Item
instance of: scholarly article
title: Finding maximum cliques on circular-arc graphs
zbMATH Open document ID: 0654.68082
DOI: 10.1016/0020-0190(87)90007-X
author: Alberto Apostolico
author: Susanne E. Hambrusch
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
review text: An algorithm is presented that, given the intersection model S of a circular-arc graph G with n vertices and m edges, finds a maximum-sized clique of G in \(O(n^ 2 \log \log n)\) time. The previous best time bound for this problem was \(O(n^ 2 \log n+mn)\).
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4068312
zbMATH Keywords: circular-arc graph
zbMATH Keywords: clique
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q3328583
cites work: Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
cites work: The NP-completeness column: an ongoing guide
cites work: Preserving order in a forest in less than logarithmic time and linear space
full work available at URL: 0020-0190(87)90007-x
OpenAlex ID: W2113796189
description: scientific article; zbMATH DE number 4068312