L. Barrì-ere, P. Flocchini, P. Fraigniaud, N. L. Santorobre67-]-r, . [. Breisch et al., Capture of an intruder by mobile agents An intuitive approach to speleotopology Monotonicity in graph searching, 14th ACM Symp. on Parallel Algorithms and Architectures, pp.72-78239, 1967.

N. Deo, S. Krishnamoorthy, M. A. Langston, J. Díaz, M. Petit et al., Exact and Approximate Solutions for the Gate Matrix Layout Problem, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.6, issue.1, pp.79-84313, 1987.
DOI : 10.1109/TCAD.1987.1270248

J. A. Ellis, I. H. Sudborough, J. S. Turner-[-kp86-]-l, C. H. Kirousis, . S. Papadimitrioulap93-]-a et al., The vertex separation and search number of a graph Searching and pebbling Recontamination does not help to search a graph, Inform. and Comput. Theoret. Comput. Sci. J. Assoc. Comput. Mach, vol.113, issue.402, pp.50-79205, 1986.

N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, C. H. Papadimitrioupar78a-]-t et al., The complexity of searching a graph Pursuit-evasion in a graph The search number of a connected graph, Theory and applications of graphs Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing Congress. Numer., XXI Utilitas Math. [Sko03], pp.18-44, 1976.

K. Skodinis, Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time, Journal of Algorithms, vol.47, issue.1, pp.40-59, 2003.
DOI : 10.1016/S0196-6774(02)00225-0