An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
Debashis Bera, Madhumangal Pal, Tapan Kumar Pal · International Journal of Computer Mathematics · 2002
In this paper, to find all maximal cliques of a trapezoid graph a set of intervals have been constructed by projecting the geometrical representation of the graph on the bottom line. The proposed algorithm for this purpose takes O(n 2 + yn) time, where n is the number of vertices of the graph and y is the output size.