A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Design and analysis of computer algortihms, 1974.

J. Amilhastre, Repr esentation par automates de l'ensemble des solutions d'un probl eme de satisfaction de contraintes, 1994.

K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, vol.13, issue.3, pp.335-379, 1976.
DOI : 10.1016/S0022-0000(76)80045-1

D. Corneil, S. Olariu, and L. Stewart, The ultimate interval graph recognition algorithm. Extended abstract, 1997.

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, EEcient and practical modular decomposition, Proc. of SODA, 1997.
DOI : 10.1006/jagm.2001.1185
URL : http://carbon.cudenver.edu/~rmcconne/linearDecompJournal.ps

M. Habib, R. Mcconnell, C. Paul, and L. Viennot, Lex-bfs and partition reenement , with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoritical Computer Science, 1997.
DOI : 10.1016/s0304-3975(97)00241-7
URL : http://doi.org/10.1016/s0304-3975(97)00241-7

J. E. Hopcropft, A nlogn algorithm for minizing states in a nite automaton, Theory of Machine and Computations, pp.189-196, 1971.

W. L. Hsu, A simple test for the consecutive ones property, LNCS 650, pp.459-468, 1992.

N. Korte and R. Mm, An Incremental Linear-Time Algorithm for Recognizing Interval Graphs, SIAM Journal on Computing, vol.18, issue.1, pp.68-81, 1989.
DOI : 10.1137/0218005

A. Lubiw, Doubly lexical orderings of matrices, SIAM Journ. of Algebraic Disc. Meth, vol.17, pp.854-879, 1987.

R. M. Mcconnell and J. P. Spinrad, Linear-time modular decomposition and efcient transitive orientation of comparability graphs, Proc. of SODA, pp.536-545, 1994.

R. M. Mcconnell and J. P. Spinrad, Linear-time modular decomposition and eecient transitive orientation of undirected graphs, Proc. of SODA, 1997.

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

D. J. Rose, R. Endre-tarjan, and G. S. Leuker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.266-283, 1976.
DOI : 10.1137/0205021

R. E. Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM, vol.22, issue.2, pp.215-225, 1975.
DOI : 10.1145/321879.321884