A segment tree can be built from n intervals in O(n log n) time using O(n log n) space. A segment tree can answer maximum clique queries in time proportional to O(i log i), where i is the size of the interval subset used in the query.
SegmentTree-rvc.1.mcz