K. Arvind, V. Kamakoti, and C. P. Rangan, Efficient Parallel Algorithms for Permutation Graphs, Journal of Parallel and Distributed Computing, vol.26, issue.1, pp.116-124, 1995.
DOI : 10.1006/jpdc.1995.1052

H. C. Chen and Y. L. Wang, A linear time algorithm for finding depth-first spanning trees on trapezoid graphs, Information Processing Letters, vol.63, issue.1, pp.13-18, 1997.
DOI : 10.1016/S0020-0190(97)00088-4

D. G. Corneil and P. A. Kamula, Extensions of Permutation and Interval Graphs, Congressus Numerantium, vol.58, pp.267-275, 1987.

I. Dagan, M. C. Golumbic, and R. Y. Pinter, Trapezoid graphs and their coloring, Discrete Applied Mathematics, vol.21, issue.1, pp.35-46, 1988.
DOI : 10.1016/0166-218X(88)90032-7

M. Hota, M. Pal, and T. K. , Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs, Computational Optimization and Applications, vol.27, issue.1, pp.95-113, 2004.
DOI : 10.1023/B:COAP.0000004982.13444.bc

J. Jájá, Introduction to Parallel Algorithms, 1992.

E. Köhler, Connected domination and dominating clique in trapezoid graphs, Discrete Applied Mathematics, vol.99, issue.1-3, pp.91-110, 2000.
DOI : 10.1016/S0166-218X(99)00127-4

T. H. Ma and J. P. Spinrad, On the 2-Chain Subgraph Cover and Related Problems, Journal of Algorithms, vol.17, issue.2, pp.251-268, 1994.
DOI : 10.1006/jagm.1994.1034

A. P. Sprague and K. H. Kulkarni, Optimal parallel algorithms for finding cut vertices and bridges of interval graphs, Information Processing Letters, vol.42, issue.4, pp.229-234, 1992.
DOI : 10.1016/0020-0190(92)90244-P

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

R. E. Tarjan and U. Vishkin, An Efficient Parallel Biconnectivity Algorithm, SIAM Journal on Computing, vol.14, issue.4, pp.862-874, 1985.
DOI : 10.1137/0214061

Y. H. Tsin and F. Y. Chen, Efficient Parallel Algorithms for a Class of Graph Theoretic Problems, SIAM Journal on Computing, vol.13, issue.3, pp.580-599, 1984.
DOI : 10.1137/0213036