A sequential and parallel algorithm for disjoint cliques problem on interval graphs
Using DAG approach,A sequential algorithm is presented to solve disjoint cliques problem on interval graph G which takes O(n^2) time where n is the number of vertices

