AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs

DOI10.1006/jagm.1997.0868zbMath0887.68042MaRDI QIDQ4373007

Binay K. Bhattacharya, D. Kaller

Publication date: 25 May 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1997.0868

zbMATH Keywords

circular-arc graphs

Mathematics Subject Classification ID

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

68W10: Parallel algorithms in computer science

Related Items

Perfect circular arc coloring