A. Berry, R. Krueger, G. Simonet, and G. Simonet, Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings, SIAM Journal on Discrete Mathematics, vol.23, issue.1, pp.428-446, 2009.
DOI : 10.1137/070684355
URL : https://hal.archives-ouvertes.fr/lirmm-00366108

A. Brandstädt, F. F. Dragan, and F. Nicolai, LexBFS-orderings and powers of chordal graphs, Discrete Mathematics, vol.171, issue.1-3, pp.1-3, 1997.
DOI : 10.1016/S0012-365X(96)00070-2

A. Bretscher, D. Corneil, M. Habib, and C. Paul, A Simple Linear Time LexBFS Cograph Recognition Algorithm, SIAM Journal on Discrete Mathematics, vol.22, issue.4, pp.1277-1296, 2008.
DOI : 10.1137/060664690
URL : https://hal.archives-ouvertes.fr/lirmm-00269525

D. Corneil and R. Krueger, A Unified View of Graph Searching, SIAM Journal on Discrete Mathematics, vol.22, issue.4, pp.1259-1276, 2008.
DOI : 10.1137/050623498

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, Partially complemented representations of digraphs, Discrete Math, Theoret. Comput. Sci, vol.5, pp.147-168, 2002.

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.1-2, 2000.
DOI : 10.1016/S0304-3975(97)00241-7

B. Jamison and S. Olariu, On the semi-perfect elimination, Advances in Applied Mathematics, vol.9, issue.3, pp.364-376, 1988.
DOI : 10.1016/0196-8858(88)90019-X

D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.266-283, 1976.
DOI : 10.1137/0205021

D. R. Shier, Some aspects of perfect elimination orderings in chordal graphs, Discrete Applied Mathematics, vol.7, issue.3, pp.325-331, 1984.
DOI : 10.1016/0166-218X(84)90008-8

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

R. E. Tarjan and M. Yannakakis, Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984.
DOI : 10.1137/0213035

P. Van-emde and . Boas, Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters, vol.6, issue.3, pp.80-82, 1977.
DOI : 10.1016/0020-0190(77)90031-X

P. Van-emde-boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Mathematical Systems Theory, vol.22, issue.1, pp.99-127, 1977.
DOI : 10.1007/BF01683268