Showing papers on "K-tree published in 1987"

TL;DR: 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.

TL;DR: This note addresses the following question: Which graphs G on n vertices with w ( G ) = r have the maximum number of cliques?