S. [. Coudert and Q. Perennes, -c. Pham, and 1.-S. SereniRerouting requests in wdm networks, AlgoTel'05, pp.17-20, 2005.
URL : https://hal.archives-ouvertes.fr/dumas-01157683

D. Coudert and 1. Sereni, Characterization of graphs and digraphs with small process number [Online) Available: hup://hal.inriaJr/inria-OO 171083, Optical WDM Networks, 2006.

R. Dutta, A. Kamal, and G. Rouskas, Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers, ser. Optical Networks, 2008.
DOI : 10.1007/978-0-387-74518-3

P. Saengudomlert, E. Modiano, and R. Gallager, On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks, IEEE/ACM Transactions on Networking, vol.14, issue.2, pp.330-340, 2006.
DOI : 10.1109/TNET.2006.872549

G. Lu, I. Xiao, and . Chlamtac, Analysis of blocking probability for distributed lightpath establishment in WDM optical networks, IEEEIACM Trans. Netw, vol.13, issue.I, pp.187-197, 2005.

J. and A. Somani, Connection rerouting/network reconfiguration, Design of Reliable Communication Networks, pp.23-30, 2003.

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

F. Fomin, D. Thilikos, ). Coudert, D. Mazauric, N. Megiddo et al., An annotated bibliography on guaranteed graph searchingNetwork reconfiguration using copsand-robber games INRIA, Tech. Rep. inria-003I5568 [Online) AvailableGraph minors. I. Excluding a forestThe complexity of searching a graph, Theo. Compo Sci. J. Combin. Theory Ser. B J. Assoc. Comput. Mach, vol.399, issue.35 I, pp.236-245, 1983.

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

). H. Bodlaender, R. H. Mohring, H. L. Bodlaender, T. Kloks, D. Kratsch-suchan et al., The Pathwidth and Treewidth of Cographs, Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.181-188, 1993.
DOI : 10.1137/0406014

). H. Bodlaender, H. Gilbert, T. Hafsteinsson, and . Kloks, Approximating treewidth, pathwidth, frontsize, and shortest elimination treeExact and approximate solutions for the gate matrix layout problem, Journal of Algorithms IEEE Transactions on Computer-Aided Design, vol.18, issue.6, pp.238-255, 1987.