AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
From MaRDI portal
Publication:4373007
DOI10.1006/jagm.1997.0868zbMath0887.68042MaRDI QIDQ4373007
D. Kaller, Binay K. Bhattacharya
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
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Subgraph extraction and metaheuristics for the maximum clique problem, Perfect circular arc coloring, Succinct encodings for families of interval graphs, Interval Routing Schemes for Circular-Arc Graphs