Implement and compare interval graph recognition algorithms

[krzysztof-turowski]

Example algorithms:

• Booth, Lueker (1976) - Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms
• Habib, McConnell, Paul, Viennot (2000) - Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• Corneil, Olariu, Stewart (1998/2009) - The Ultimate Interval Graph Recognition Algorithm? + The LBFS Structure and Recognition of Interval Graphs
• Kratsch, McConnell, Mehlhorn, Spinrad (2006) - Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs

Algorithm for unit interval graphs

• Corneil (2003) - A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs