C. , A. Cournier, and M. Habib, A new linear algorithm of modular decomposition, Trees in algebra and programming|CAAP 94 (Edinburgh) Lecture Notes in Computer Science, pp.68-84, 1994.

R. Cole, Parallel merge sort, SIAM J. Comput, vol.17, issue.4, 1988.

E. Dalhaus, EEcient parallel modular decomposition, WG '95 21st International Workshop on Graph-Theoretic Concepts in Computer Science. M. Nagl, 1995.

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

]. M. Gol85 and . Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1985.

R. H. Mohring, Computationally Tractable Classes of Ordered Sets, Algorithms and Order, 1989.
DOI : 10.1007/978-94-009-2639-4_4

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

B. Mark and . Novick, Fast parallel algorithms for the modular decomposition, 1989.

B. Mark and . Novick, Logaithmic time parallel algorithms for recognizing comparability and interval graphs, 1989.

Y. Shiloah and U. Vishkin, An O(logn) parallel connectivity algorithm, Journal of Algorithms, vol.3, issue.1, pp.57-67, 1982.
DOI : 10.1016/0196-6774(82)90008-6

]. R. Tar85 and . Tarjan, An eecient parallel biconnectivity algorithm, SIAM J. Computing, vol.14, pp.862-874, 1985.