1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms, Addison-Wesley (1974)
2. Cournier, A., Habib, M.: A new linear algorithm for modular decomposition, CAAP '94: 19th international colloquium, lecture notes in computer science, Sophie Tison, ed., Edinburgh, UK (1994) 68–82
3. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Algorithms, MIT Press (1990)
4. Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical modular decomposition, Proc. 8th annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans (1997) 26–35
5. Ehrenfeucht, A., Gabow, H.N., McConnell, R.M., Sullivan, S.J.: An O(n
2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs, Journal of Algorithms 16 (1994) 283–294