A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974.

A. Cournier and M. Habib, A new linear algorithm for Modular Decomposition, Trees in Algebra and Programming, CAAP '94, pp.68-82, 1994.
DOI : 10.1007/BFb0017474

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.
URL : https://hal.archives-ouvertes.fr/inria-00072855

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, Efficient and Practical Algorithms for Sequential Modular Decomposition, Journal of Algorithms, vol.41, issue.2, pp.360-387, 2001.
DOI : 10.1006/jagm.2001.1185
URL : https://hal.archives-ouvertes.fr/inria-00072855

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

A. Ehrenfeucht and G. Rozenberg, Theory of 2-structures, part I: Clans, basic subclasses, and morphisms, Theoretical Computer Science, vol.70, issue.3, pp.277-303, 1990.
DOI : 10.1016/0304-3975(90)90129-6

A. Ehrenfeucht and G. Rozenberg, Theory of 2-structures, part II: Representation through labeled tree families, Theoretical Computer Science, vol.70, issue.3, pp.305-342, 1990.
DOI : 10.1016/0304-3975(90)90130-A

A. Ehrenfeucht and G. Rozenberg, Angular 2-structures, Theoretical Computer Science, vol.92, issue.2, pp.227-248, 1992.
DOI : 10.1016/0304-3975(92)90313-5

A. Ehrenfeucht and G. Rozenberg, Dynamic labeled 2-structures, Mathematical Structures in Computer Science, vol.532, issue.04, pp.433-455, 1994.
DOI : 10.1016/0304-3975(92)90313-5

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

D. Harel and R. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM Journal on Computing, vol.13, issue.2, pp.338-355, 1984.
DOI : 10.1137/0213024

R. Mcconnell, Complement-equivalence classes on graphs, Structures in Logic and Computer Science, 1997.
DOI : 10.1007/3-540-63246-8_11

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, 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, Ordered vertex partitioning, Discrete Mathematics and Theoretical Computer Science, vol.4, pp.45-60, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00958944

R. H. Möhring, Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions, Annals of Operations Research, vol.69, issue.1, pp.195-225, 1985.
DOI : 10.1007/BF02022041

J. H. Muller and J. P. Spinrad, Incremental modular decomposition, Journal of the ACM, vol.36, issue.1, pp.1-19, 1989.
DOI : 10.1145/58562.59300

J. P. Spinrad, P4-trees and substitution decomposition, Discrete Applied Mathematics, vol.39, issue.3, pp.263-291, 1992.
DOI : 10.1016/0166-218X(92)90180-I