R. L. Breisch, An intuitive approach to speleotopology. Southwestern Cavers, pp.72-78, 1967.

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse, Tradeoffs when optimizing lightpaths reconfiguration in WDM networks, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00421140

D. Coudert, F. Huc, and D. Mazauric, A Distributed Algorithm for Computing and Updating the Process Number of a Forest, 22nd Int. Symposium on Distributed Computing (DISC), pp.500-501, 2008.
DOI : 10.1007/978-3-540-87779-0_36
URL : https://hal.archives-ouvertes.fr/inria-00373850

D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J. Sereni, Routing reconfiguration/process number: Coping with two classes of services, 13th Conf. on Optical Network Design and Modeling (ONDM), 2009.

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

D. Coudert and J. 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

N. Deo, S. Krishnamoorthy, and M. A. Langston, 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-84, 1987.
DOI : 10.1109/TCAD.1987.1270248

J. A. Ellis, I. H. Sudborough, and J. S. 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

F. Fomin and D. 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
URL : http://doi.org/10.1016/j.tcs.2008.02.040

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

N. Jose and A. K. Somani, Connection rerouting/network reconfiguration, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings., 2003.
DOI : 10.1109/DRCN.2003.1275334

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-44, 1988.
DOI : 10.1145/42267.42268

T. D. Parsons, Pursuit-evasion in a graph, Theory and applications of graphs, pp.426-441, 1978.
DOI : 10.1007/BFb0070400

N. Robertson and P. D. Seymour, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-61, 1983.
DOI : 10.1016/0095-8956(83)90079-5
URL : http://doi.org/10.1006/jctb.1999.1919

F. Solano, Analyzing two different objectives of the WDM network reconfiguration problem, IEEE Global Communications Conference, 2009.

F. Solano and M. Pióro, A mixed-integer programing formulation for the lightpath reconfiguration problem, VIII Workshop on G/MPLS Networks, 2009.