A maximal set of disjoint intervals is a standard algorithm question.
Basically given a set of overlapping intervals, (1,2),(2,6),(1,10),(6,13), we can choos
(1,2),(2,6),(1,10),(6,13)
