A. Berry, R. Krueger, and G. Simonet, Ultimate Generalizations of LexBFS and LEX M, Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science 2005 (WG 2005), pp.199-213, 2005.
DOI : 10.1007/11604686_18

A. Berry, R. Krueger, and G. Simonet, Maximal Label Search Algorithms to compute minimal elimination orderings. LIMOS/RR-07-04, Ensemble scientifique des Cézeaux, F-63177Aubì ere, France
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.27-42, 1997.
DOI : 10.1016/S0012-365X(96)00070-2

A. Bretscher, D. G. Corneil, M. Habib, and C. Paul, A Simple Linear Time LexBFS Cograph Recognition Algorithm, Proceedings of WG'03: 29th International Workshop on Graph-Theoretic Concepts in Computer Science, pp.119-130, 2003.
DOI : 10.1137/060664690
URL : https://hal.archives-ouvertes.fr/lirmm-00269525

D. G. Corneil and R. Krueger, A unified view of graph searching. Submitted. Extended abstract as Simple vertex ordering characterizations for graph search, Proceedings of ICGT'05: 7th International Colloquium on Graph Theory

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, Partially complemented representations of digraphs, Discrete Math. Theoretical Computer Science, vol.5, p.147168, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00072825

D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics, vol.15, issue.3, pp.835-855, 1965.
DOI : 10.2140/pjm.1965.15.835
URL : http://projecteuclid.org/download/pdf_1/euclid.pjm/1102995572

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

R. Krueger, Graph Searching

K. Mehlhorn and S. Häher, Bounded ordered dictionaries in O(log log N) time and O(n) space, Information Processing Letters, vol.35, issue.4, pp.183-189, 1990.
DOI : 10.1016/0020-0190(90)90022-P

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

K. Simon, A new simple linear algorithm to recognize interval graphs, Workshop on Computational Geometry, pp.289-308, 1991.
DOI : 10.1007/3-540-54891-2_22

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