R. Ganian, P. Hlinen´yhlinen´y, J. Kneis, D. Meister, J. Obdrzálek et al., Are there any good digraph width measures?, 5th Int. Symp. on Parameterized and Exact Computation, pp.135-146, 2010.

J. Barát, Directed Path-width and Monotonicity in Digraph Searching, Graphs and Combinatorics, vol.22, issue.2, pp.161-172, 2006.
DOI : 10.1007/s00373-005-0627-y

P. Hunter and S. Kreutzer, Digraph measures: Kelly decompositions, games, and orderings, Theoretical Computer Science, vol.399, issue.3, pp.206-219, 2008.
DOI : 10.1016/j.tcs.2008.02.038

D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer, and J. Obdrzálek, The dag-width of directed graphs, Journal of Combinatorial Theory, Series B, vol.102, issue.4, pp.900-923, 2012.
DOI : 10.1016/j.jctb.2012.04.004

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

P. D. Seymour and R. Thomas, Graph Searching and a Min-Max Theorem for Tree-Width, Journal of Combinatorial Theory, Series B, vol.58, issue.1, pp.22-33, 1993.
DOI : 10.1006/jctb.1993.1027

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

A. S. Lapaugh, Recontamination does not help to search a graph, Journal of the ACM, vol.40, issue.2, pp.224-245, 1993.
DOI : 10.1145/151261.151263

D. Bienstock and P. Seymour, Monotonicity in graph searching, Journal of Algorithms, vol.12, issue.2, pp.239-245, 1991.
DOI : 10.1016/0196-6774(91)90003-H

F. Mazoit and N. Nisse, Monotonicity of non-deterministic graph searching, Theoretical Computer Science, vol.399, issue.3, pp.169-178, 2008.
DOI : 10.1016/j.tcs.2008.02.036
URL : https://hal.archives-ouvertes.fr/hal-00306321

B. Yang, D. Dyer, and B. Alspach, Sweeping graphs with large clique number, Discrete Mathematics, vol.309, issue.18, pp.5770-5780, 2009.
DOI : 10.1016/j.disc.2008.05.033

P. Fraigniaud and N. Nisse, Monotony properties of connected visible graph searching, Information and Computation, vol.206, issue.12, pp.1383-1393, 2008.
DOI : 10.1016/j.ic.2008.09.002
URL : https://hal.archives-ouvertes.fr/hal-00421416

T. Johnson, N. Robertson, P. D. Seymour, and R. Thomas, Directed Tree-Width, Journal of Combinatorial Theory, Series B, vol.82, issue.1, pp.138-154, 2001.
DOI : 10.1006/jctb.2000.2031

I. Adler, Directed tree-width examples, Journal of Combinatorial Theory, Series B, vol.97, issue.5, pp.718-725, 2007.
DOI : 10.1016/j.jctb.2006.12.006

S. Kreutzer and S. Ordyniak, Digraph decompositions and monotonicity in digraph searching

P. Hunter, Losing the +1: Directed path-width games are monotone, 2006.

B. Yang and Y. Cao, Digraph Strong Searching: Monotonicity and Complexity, pp.37-46, 2007.
DOI : 10.1007/978-3-540-72870-2_4

B. Yang and Y. Cao, On the Monotonicity of Weak Searching, pp.52-61, 2008.
DOI : 10.1007/978-3-540-69733-6_6

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

B. Mukherjee, WDM-based local lightwave networks. II. Multihop systems, IEEE Network, vol.6, issue.4, pp.20-32, 1992.
DOI : 10.1109/65.145161

N. Jose and A. 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

X. Chu, T. Bu, and X. Li, A Study of Lightpath Rerouting Schemes in Wavelength-Routed WDM Networks, 2007 IEEE International Conference on Communications, pp.2400-2405, 2007.
DOI : 10.1109/ICC.2007.403

F. Solano and M. Pióro, Lightpath Reconfiguration in WDM Networks, Journal of Optical Communications and Networking, vol.2, issue.12, pp.1010-1021, 2010.
DOI : 10.1364/JOCN.2.001010

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse, Tradeoffs in process strategy games with application in the WDM reconfiguration problem, Theoretical Computer Science, vol.412, issue.35, pp.4675-4687, 2011.
DOI : 10.1016/j.tcs.2011.05.002
URL : https://hal.archives-ouvertes.fr/inria-00495443

N. G. Kinnersley, The vertex separation number of a graph equals its path-width, Information Processing Letters, vol.42, issue.6, pp.345-350, 1992.
DOI : 10.1016/0020-0190(92)90234-M

D. Coudert and J. Sereni, Characterization of graphs and digraphs with small process numbers, Discrete Applied Mathematics, vol.159, issue.11, pp.1094-1109, 2011.
DOI : 10.1016/j.dam.2011.03.010

D. Coudert, F. Huc, and D. Mazauric, A Distributed Algorithm for Computing the Node Search Number in Trees, Algorithmica, vol.47, issue.1, pp.158-190, 2012.
DOI : 10.1007/s00453-011-9524-3
URL : https://hal.archives-ouvertes.fr/inria-00587819

D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J. Sereni, Routing reconfiguration/process number: Coping wih two classes of services, 13th Conference on Optical Network Design and Modeling (ONDM), 2009.
URL : https://hal.archives-ouvertes.fr/inria-00331807

F. Solano, Analyzing Two Conflicting Objectives of the WDM Lightpath Reconfiguration Problem, GLOBECOM 2009, 2009 IEEE Global Telecommunications Conference, pp.1-7, 2009.
DOI : 10.1109/GLOCOM.2009.5426108

F. Solano and M. Pióro, A mixed-integer programing formulation for the lightpath reconfiguration problem, 2009.