E. Dahlhaus, Efficient parallel modular decomposition, 21 st Int'l Workshop on Graph Theoretic Concepts in Comp. Sci. (WG 95, 1995.
DOI : 10.1007/3-540-60618-1_83

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, Efficient and practical modular decomposition, Proceedings of the eighth annual ACM-SIAM symposium on discrete algorithms, pp.26-35, 1997.
DOI : 10.1006/jagm.2001.1185
URL : https://hal.archives-ouvertes.fr/inria-00100822

A. Ehrenfeucht, H. N. Gabow, R. M. Mcconnell, and S. J. Sullivan, An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs, Journal of Algorithms, vol.16, issue.2, pp.283-294, 1994.
DOI : 10.1006/jagm.1994.1013

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.1007/BF02020961

M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1980.

M. Habib, R. Mcconnell, C. Paul, and L. Viennot, Transitive orientation, interval graph recognition, and consecutive ones testing, Theoretical Computer Science

R. M. Mcconnell and J. P. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, vol.201, issue.1-3, pp.189-241, 1999.
DOI : 10.1016/S0012-365X(98)00319-7

R. M. Mcconnell and J. P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.536-545, 1994.

R. M. Mcconnell and J. P. Spinrad, Linear-time transitive orientation, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.19-25, 1997.

R. H. Möhring, Algorithmic Aspects of Comparability Graphs and Interval Graphs, Graphs and Order, pp.41-101, 1985.
DOI : 10.1007/978-94-009-5315-4_2