D. Coudert, F. Huc, and D. Mazauric, A Distributed Algorithm for Computing and Updating the Process Number of a Forest, Research Report, vol.6560, p.6, 2008.
DOI : 10.1007/978-3-540-87779-0_36
URL : https://hal.archives-ouvertes.fr/inria-00373850

D. Coudert, S. Perennes, Q. Pham, and J. Sereni, Rerouting requests in wdm networks, AlgoTel'05, pp.17-20, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00429173

J. [. Coudert and . Sereni, Characterization of graphs and digraphs with small process numbers, Discrete Applied Mathematics, vol.159, issue.11, 2007.
DOI : 10.1016/j.dam.2011.03.010

J. Díaz, J. Petit, and M. Serna, A survey of graph layout problems, ACM Computing Surveys, vol.34, issue.3, pp.313-356, 2002.
DOI : 10.1145/568522.568523

I. [. Ellis, J. S. Sudborough, and . Turner, The Vertex Separation and Search Number of a Graph, Information and Computation, vol.113, issue.1, pp.50-79, 1994.
DOI : 10.1006/inco.1994.1064

D. [. Fomin and . Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3, pp.236-245, 2008.
DOI : 10.1016/j.tcs.2008.02.040

]. N. Kin92 and . Kinnersley, The vertex separation number of a graph equals its pathwidth, Information Processing Letters, vol.42, issue.6, pp.345-350, 1992.

M. Kirousis and C. H. Papadimitriou, Searching and pebbling, Theoretical Computer Science, vol.47, issue.2, pp.205-218, 1986.
DOI : 10.1016/0304-3975(86)90146-5

N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou, The complexity of searching a graph, Journal of the ACM, vol.35, issue.1, pp.18-4439, 1983.
DOI : 10.1145/42267.42268

]. K. Sko03 and . 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.