Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications

DOI10.1142/S0129054197000288zbMath0894.68112MaRDI QIDQ4385200

Terrance A. Mankus, Glenn K. Manacher

Publication date: 25 May 1998

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

maximum cliqueproper circular arcs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Mutual exclusion scheduling with interval graphs or related classes. I

This page was built for publication: Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications