C. Capelle, Block decomposition of inheritance hierarchies, Theoretic Concepts in Computer Science -WG'97 number 1335 in LNCS, pp.118-131, 1997.
DOI : 10.1007/BFb0024493

C. Capelle, Décompositions de Graphes et Permutations Factorisantes, 1997.

C. Capelle and M. Habib, Graph decompositions and factorizing permutations, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp.132-143, 1997.
DOI : 10.1109/ISTCS.1997.595165

URL : https://hal.archives-ouvertes.fr/hal-00958972

A. Cournier and M. Habib, A new linear algorithm for Modular Decomposition Lectures notes in Computer Science, 787, Trees in Algebra and Programming-CAAP'94, pp.68-84, 1994.

W. H. Cunningham and J. Edmonds, A combinatorial decomposition theory. Canad, J. Math, vol.32, issue.3, pp.734-765, 1980.

W. H. Cunningham, Decomposition of Directed Graphs, SIAM Journal on Algebraic Discrete Methods, vol.3, issue.2, pp.214-228, 1982.
DOI : 10.1137/0603021

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, Efficient and Practical Modular Decomposition, 8th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), pp.26-35, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00100822

R. Ducournau and M. Habib, La multiplicité de l'héritage dans les langagesàlangages`langagesà objets, Technique et Science Informatique, vol.8, issue.1, pp.41-62, 1989.

M. C. Golumbic, Algorithmic graph theory and perfect graphs, 1980.

M. Habib, M. Huchard, and J. Spinrad, A linear algorithm to decompose inheritance graphs into modules, Algorithmica, vol.11, issue.6, pp.573-591, 1995.
DOI : 10.1007/BF01189070

M. Habib, R. Mcconnell, C. Paul, and L. Viennot, Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoretical Computer Science, vol.234, issue.1-2, pp.59-84, 2000.
DOI : 10.1016/S0304-3975(97)00241-7

URL : http://doi.org/10.1016/s0304-3975(97)00241-7

M. Habib and C. Paul, A simple linear time algorithm for cograph recognition, Discrete Applied Mathematics, vol.145, issue.2, 2000.
DOI : 10.1016/j.dam.2004.01.011

URL : https://hal.archives-ouvertes.fr/lirmm-00105298

M. Habib, C. Paul, and L. Viennot, PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.147-170, 1999.
DOI : 10.1142/S0129054199000125

J. E. Hopcroft and R. E. Tarjan, Dividing a Graph into Triconnected Components, SIAM Journal on Computing, vol.2, issue.3, pp.135-158, 1973.
DOI : 10.1137/0202012

W. Hsu, A simple test for interval graphs, Lecture Notes in Computer Science, vol.657, pp.11-16, 1992.
DOI : 10.1007/3-540-56402-0_31

W. Hsu and T. Ma, Substitution decomposition on chordal graphs and applications, Proceedings of the 2nd ACM-SIGSAM International Symposium on Symbolic and Algebraic Computation, pp.52-60, 1991.
DOI : 10.1007/3-540-54945-5_49

M. Huchard, Sur quelques questions algorithmiques de l'héritage multiple, 1992.

T. Ma and J. Spinrad, An O(n2) Algorithm for Undirected Split Decomposition, Journal of Algorithms, vol.16, issue.1, pp.145-160, 1994.
DOI : 10.1006/jagm.1994.1007

R. Mcconnell and J. Spinrad, Linear-Time Modular Decomposition and Efficient Transitive Orientation of Undirected Graphs, Proc. of the fifth Annual ACM-SIAM Symposium of Discrete Algorithms, pp.536-545, 1994.

R. M. Mcconnell and J. 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. H. Möhring and F. J. Radermacher, Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization, Ann. Discrete math, vol.19, pp.257-356, 1984.
DOI : 10.1016/S0304-0208(08)72966-9

C. Paul, Parcours en Largeur Lexicographique : Un Algorithme de Partitionnement, Application aux Graphes et Généralisations, 1998.