Finding maximum cliques on circular-arc graphs
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)\).
scientific article; zbMATH DE number 4068312