P. W. Brendan, A. Ames, R. Beveridge, C. Carlson, V. Djang et al., A leapfrog strategy for pursuit-evasion in a polygonal environment, Int. J. Comput. Geometry Appl, vol.25, issue.2, pp.77-100, 2015.

O. Amini, D. Coudert, and N. Nisse, Non-deterministic graph searching in trees, Theor. Comput. Sci, vol.580, pp.101-121, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01132032

B. Alspach, D. Dyer, D. Hanson, and B. Yang, Arc searching digraphs without jumping, Proc. of first int. conf. on Combinatorial Optimization and Applications (COCOA), vol.4616, pp.354-365, 2007.

I. Adler, Directed tree-width examples, J. Comb. Theory, Ser. B, vol.97, issue.5, pp.718-725, 2007.

S. Saeed-akhoondian-amiri, R. Kreutzer, and . Rabinovich, Dagwidth is pspace-complete, Theor. Comput. Sci, vol.655, pp.78-89, 2016.

B. Alspach, Searching and sweeping graphs: a brief survey, Mathematiche, vol.59, pp.65-102, 2004.

J. Barát, Directed path-width and monotonicity in digraph searching, Graphs and Combinatorics, vol.22, issue.2, pp.161-172, 2006.

T. Berthomé, F. Bouvier, N. Mazoit, R. Nisse, and . Soares, An Unified FPT Algorithm for Width of Partition Functions, INRIA, 2013.

L. Blin, J. Burman, and N. Nisse, Brief announcement: Distributed exclusive and perpetual tree searching, Proc. of 26th International Symposium on Distributed Computing (DISC), vol.7611, pp.403-404, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00741982

L. Blin, J. Burman, and N. Nisse, Exclusive graph searching, Algorithmica, vol.77, issue.3, pp.942-969, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00845530

. +-12]-dietmar, A. Berwanger, P. Dawar, S. Hunter, J. Kreutzer et al., The dag-width of directed graphs, J. Comb. Theory, Ser. B, vol.102, issue.4, pp.900-923, 2012.

P. Borowiecki, D. Dereniowski, and L. Kuszner, Distributed graph searching with a sense of direction, Distributed Computing, vol.28, issue.3, pp.155-170, 2015.

L. Hans, F. V. Bodlaender, and . Fomin, Approximation of pathwidth of outerplanar graphs, J. Algorithms, vol.43, issue.2, pp.190-200, 2002.

P. +-12]-lalibarrì-ere, . Flocchini, V. Fedor, P. Fomin, N. Fraigniaud et al., Connected graph searching, Inf. Comput, vol.219, pp.1-16, 2012.

P. Lalibarrì-ere, P. Flocchini, N. Fraigniaud, and . Santoro, Capture of an intruder by mobile agents, Proc. of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp.200-209, 2002.

L. Hans, F. V. Bodlaender, D. Fomin, E. Lokshtanov, and . Penninkx, Saket Saurabh, and Dimitrios M. Thilikos. (meta) kernelization. In 50th

, Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.629-638, 2009.

L. Blin, P. Fraigniaud, N. Nisse, and S. Vial, Distributed chasing of network intruders, Theor. Comput. Sci, vol.399, issue.1-2, pp.12-37, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01311355

P. Lalibarrì-ere, N. Fraigniaud, D. M. Santoro, and . Thilikos, Searching is not jumping, Proc. of 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.2880, pp.34-45, 2003.

M. J. Best, A. Gupta, D. M. Thilikos, and D. Zoros, Contraction obstructions for connected graph searching, Discrete Applied Mathematics, vol.209, pp.27-47, 2016.

F. Brandenburg and S. Herrmann, Graph searching and search time, 32nd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), vol.3831, pp.197-206, 2006.

D. Bienstock, Graph searching, path-width, tree-width and related problems (A survey), Proc. of Reliability Of Computer And Communication Networks, a DIMACS Workshop, vol.5, pp.33-50, 1991.

L. Hans, T. Bodlaender, and . Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms, vol.21, issue.2, pp.358-402, 1996.

D. Bhadauria, K. Klein, V. Isler, and S. Suri, Capturing an evader in polygonal environments with obstacles: The full visibility case, I. J. Robotics Res, vol.31, issue.10, pp.1176-1189, 2012.

A. Brandstädt, J. P. Van-bang-le, and . Spinrad, Graph Classes: A Survey, Society for Industrial and Applied Mathematics, 1999.

L. Hans, R. H. Bodlaender, and . Möhring, The pathwidth and treewidth of cographs, SIAM J. Discrete Math, vol.6, issue.2, pp.181-188, 1993.

R. S. Jean, F. Blair, R. Manne, and . Mihai, Efficient self-stabilizing graph searching in tree networks, Proc. of 12th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol.6366, pp.111-125, 2010.

A. Bonato and R. J. Nowakovski, The game of Cops and Robber on Graphs, 2011.

L. Hans and . Bodlaender, A partial k -arboretum of graphs with bounded treewidth, Theor. Comput. Sci, vol.209, issue.1-2, pp.1-45, 1998.

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

R. L. Breish, Lost in a Cave: applying graph theory to cave exploration, 2012.

D. Bienstock, N. Robertson, P. D. Seymour, and R. Thomas, Quickly excluding a forest, J. Comb. Theory, Ser. B, vol.52, issue.2, pp.274-283, 1991.

D. Bienstock and P. D. Seymour, Monotonicity in graph searching, J. Algorithms, vol.12, issue.2, pp.239-245, 1991.

L. Hans, D. M. Bodlaender, and . Thilikos, Computing small search numbers in linear time, Proc. of First Int. Workshop on Parameterized and Exact Computation (IWPEC), vol.3162, pp.37-48, 2004.

R. B. Borie, C. A. Tovey, and S. Koenig, Algorithms and complexity results for graph-based pursuit evasion, Auton. Robots, vol.31, issue.4, pp.317-332, 2011.

D. +-11]-nathann-cohen, D. Coudert, N. Mazauric, N. Nepomuceno, and . Nisse, Tradeoffs in process strategy games with application in the WDM reconfiguration problem, Theor. Comput. Sci, vol.412, issue.35, pp.4675-4687, 2011.

D. G. Corneil, J. Dusart, and M. Habib, Antoine Mamcarz, and Fabien de Montgolfier. A tie-break model for graph search, Discrete Applied Mathematics, vol.199, pp.89-100, 2016.

F. V. +-15]-marek-cygan, L. Fomin, D. Kowalik, D. Lokshtanov, and . Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms, 2015.

T. H. Chung, G. A. Hollinger, and V. Isler, Search and pursuit-evasion in mobile robotics -A survey, Auton. Robots, vol.31, issue.4, pp.299-316, 2011.

F. David-coudert, D. Huc, N. Mazauric, J. Nisse, and . Sereni, Reconfiguration of the Routing in WDM Networks with Two Classes of Services, Conference on Optical Network Design and Modeling (ONDM), 2009.

D. Coudert, F. Huc, and D. Mazauric, A distributed algorithm for computing the node search number in trees, Algorithmica, vol.63, issue.1-2, pp.158-190, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00587819

D. Coudert, F. Huc, and J. Sereni, Pathwidth of outerplanar graphs, Journal of Graph Theory, vol.55, issue.1, pp.27-41, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070220

L. , S. Chandran, and T. Kavitha, The treewidth and pathwidth of hypercubes, Discrete Mathematics, vol.306, issue.3, pp.359-365, 2006.

B. Courcelle and M. Mosbah, Monadic second-order evaluations on tree-decomposable graphs, Theor. Comput. Sci, vol.109, issue.1&2, pp.49-82, 1993.
DOI : 10.1007/3-540-55121-2_2
URL : http://www.labri.fr/perso/courcell/Textes1/BC-Mosbah(1993).pdf

D. Coudert, D. Mazauric, and N. Nisse, Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth, ACM Journal of Experimental Algorithmics, vol.21, issue.1, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01266496

D. Coudert, A note on Integer Linear Programming formulations for linear ordering problems on graphs. Research report, Inria ; I3S, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01271838

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.

D. Dereniowski and D. Dyer, On minimum cost edge searching, Theor. Comput. Sci, vol.495, pp.37-49, 2013.

D. Dereniowski, . Oznur-yasar, D. Diner, and . Dyer, Three-fastsearchable graphs, Discrete Applied Mathematics, vol.161, pp.1950-1958, 2013.

D. Dereniowski, Maximum vertex occupation time and inert fugitive: Recontamination does help, Inf. Process. Lett, vol.109, issue.9, pp.422-426, 2009.
DOI : 10.1016/j.ipl.2008.12.022
URL : http://arxiv.org/abs/0802.3512

D. Dereniowski, Connected searching of weighted trees, Theor. Comput. Sci, vol.412, issue.41, pp.5700-5713, 2011.

D. Dereniowski, Approximate search strategies for weighted trees, Theor. Comput. Sci, vol.463, pp.96-113, 2012.
DOI : 10.1016/j.tcs.2012.07.006
URL : https://doi.org/10.1016/j.tcs.2012.07.006

D. Dereniowski, From pathwidth to connected pathwidth, SIAM J. Discrete Math, vol.26, issue.4, pp.1709-1732, 2012.
DOI : 10.1137/110826424
URL : https://hal.archives-ouvertes.fr/hal-00573616

Y. Daadaa, P. Flocchini, and N. Zaguia, Network decontamination with temporal immunity by cellular automata, Proc. of 9th Int. Conference on Cellular Automata for Research and Industry (ACRI), pp.287-299, 2010.
DOI : 10.1007/978-3-642-15979-4_31

E. D. Demaine and M. Hajiaghayi, The bidimensionality theory and its algorithmic applications, Comput. J, vol.51, issue.3, pp.292-302, 2008.
DOI : 10.1093/comjnl/bxm033

, Graph Theory, vol.173, 2012.

Y. Daadaa, A. Jamshed, and M. Shabbir, Network decontamination with a single agent, Graphs and Combinatorics, vol.32, issue.2, pp.559-581, 2016.
DOI : 10.1007/s00373-015-1579-5
URL : http://arxiv.org/pdf/1307.7307

N. Deo, M. S. Krishnamoorthy, and M. A. Langston, Exact and approximate solutions for the gate matrix layout problem, IEEE Trans. on CAD of Integrated Circuits and Systems, vol.6, issue.1, pp.79-84, 1987.
DOI : 10.1109/tcad.1987.1270248

N. D. Dendris, L. M. Kirousis, and D. M. Thilikos, Fugitivesearch games on graphs and related parameters, Theor. Comput. Sci, vol.172, issue.1-2, pp.233-254, 1997.
DOI : 10.1007/3-540-59071-4_59

D. Dereniowski, W. Kubiak, and Y. Zwols, The complexity of minimum-length path decompositions, J. Comput. Syst. Sci, vol.81, issue.8, pp.1715-1747, 2015.

D. Gianlorenzo, A. Angelo, N. Navarra, and . Nisse, A unified approach for gathering and exclusive searching on rings under weak assumptions. Distributed Computing, vol.30, pp.17-48, 2017.

D. Dereniowski, D. Osula, and P. Rzazewski, Finding small-width connected path decompositions in polynomial time, 2018.

D. Dsn-+-15]-gianlorenzo, G. D. Angelo, A. Stefano, N. Navarra, K. Nisse et al., Computing on rings by oblivious robots: A unified approach for different tasks, Algorithmica, vol.72, issue.4, pp.1055-1096, 2015.

D. Dereniowski and D. Urbanska, Distributed searching of partial grids, 2016.

D. Dyer and B. Yang, On the fast searching problem, Proc. of 4th Int. Conference on Algorithmic Aspects in Information and Management (AAIM), vol.5034, pp.143-154, 2008.

W. Evans, P. Hunter, and M. A. Safari, D-width and cops and robbers, 2013.

J. A. Ellis and M. Markov, Computing the vertex separation of unicyclic graphs, Inf. Comput, vol.192, issue.2, pp.123-161, 2004.

J. A. Ellis, I. H. Sudborough, and J. S. Turner, Graph separation and search number, pp.87-98, 1987.

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.

V. Fedor, P. Fomin, N. Fraigniaud, and . Nisse, Nondeterministic graph searching: From pathwidth to treewidth, Algorithmica, vol.53, issue.3, pp.358-373, 2009.

V. Fedor, P. A. Fomin, and . Golovach, Graph searching and interval completion, SIAM J. Discrete Math, vol.13, issue.4, pp.454-464, 2000.

P. Flocchini, . Miao-jun, F. L. Huang, and . Luccio, Decontaminating chordal rings and tori using mobile agents, Int. J. Found. Comput. Sci, vol.18, issue.3, pp.547-563, 2007.

P. Flocchini, . Miao-jun, F. L. Huang, and . Luccio, Decontamination of hypercubes by mobile agents, Networks, vol.52, issue.3, pp.167-178, 2008.

V. Fedor, P. Fomin, R. Heggernes, and . Mihai, Mixed search number and linear-width of interval and split graphs, Networks, vol.56, issue.3, pp.207-214, 2010.

V. Fedor, P. Fomin, J. A. Heggernes, and . Telle, Graph searching, elimination trees, and a generalization of bandwidth, Algorithmica, vol.41, issue.2, pp.73-87, 2005.

P. Fraigniaud, D. Ilcinkas, and A. Pelc, Oracle size: a new measure of difficulty for communication tasks, Proc. of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp.179-187, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00339854

R. Michael, M. A. Fellows, and . Langston, On search, decision, and the efficiency of polynomial-time algorithms, J. Comput. Syst. Sci, vol.49, issue.3, pp.769-779, 1994.

P. Flocchini, F. Luccio, L. Pagli, and N. Santoro, Network decontamination under m-immunity, Discrete Applied Mathematics, vol.201, pp.114-129, 2016.

P. Flocchini, L. Flaminia, L. Luccio, and . Song, Size optimal strategies for capturing an intruder in mesh networks, Proc. of the Int. Conference on Communications in Computing (CIC), pp.200-206, 2005.

V. Fedor, D. Fomin, S. Lokshtanov, and . Saurabh, Excluded grid minors and efficient polynomial-time approximation schemes, J. ACM, vol.65, issue.2, 2018.

P. Flocchini, B. Mans, and N. Santoro, Tree decontamination with temporary immunity, Proc. of 19th Int. Symposium on Algorithms and Computation, vol.5369, pp.330-341, 2008.

P. Fraigniaud and N. Nisse, Monotony properties of connected visible graph searching, Inf. Comput, vol.206, issue.12, pp.1383-1393, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00421416

P. Flocchini, A. Nayak, and A. Schulz, Decontamination of arbitrary networks using a team of mobile agents with limited visibility, 6th Annual IEEE/ACIS International Conference on Computer and Information Science (ICIS, pp.469-474, 2007.

V. Fedor and . Fomin, Helicopter search problems, bandwidth and pathwidth, Discrete Applied Mathematics, vol.85, issue.1, pp.59-70, 1998.

V. Fedor and . Fomin, Note on a helicopter search problem on graphs, Discrete Applied Mathematics, vol.95, issue.1-3, pp.241-249, 1999.

V. Fedor and . Fomin, Searching expenditure and interval graphs, Discrete Applied Mathematics, vol.135, issue.1-3, pp.97-104, 2004.

P. Flocchini and N. Santoro, Distributed security algorithms by mobile agents, Distributed Computing and Networking, 8th International Conference, ICDCN, vol.4308, pp.1-14, 2006.

V. Fedor, D. M. Fomin, and . Thilikos, An annotated bibliography on guaranteed graph searching, Theor. Comput. Sci, vol.399, issue.3, pp.236-245, 2008.

V. Fedor, D. M. Fomin, I. Thilikos, and . Todinca, Connected graph searching in outerplanar graphs, Electronic Notes in Discrete Mathematics, vol.22, pp.213-216, 2005.

P. Robert-ganian, J. Hlinen´yhlinen´y, D. Kneis, J. Meister, P. Obdrzálek et al., Are there any good digraph width measures?, J. Comb. Theory, Ser. B, vol.116, pp.250-286, 2016.

P. A. Golovach, P. Heggernes, and R. Mihai, Edge search number of cographs, Discrete Applied Mathematics, vol.160, issue.6, pp.734-743, 2012.

C. Archontia, P. Giannopoulou, D. M. Hunter, and . Thilikos, Lifosearch: A min-max theorem and a searching game for cycle-rank and treedepth, Discrete Applied Mathematics, vol.160, issue.15, pp.2089-2097, 2012.

L. J. Guibas, J. Latombe, S. M. Lavalle, D. Lin, and R. Motwani, A visibility-based pursuit-evasion problem, Int. J. Comput. Geometry Appl, vol.9, issue.4/5, pp.471-494, 1999.

P. A. Golovach, Equivalence of two formalizations of a search problem on a graph, Vestnik Leningrad Univ. Math, vol.22, pp.13-19, 1989.

P. A. Golovach, A topological invariant in pursuit problems, Differ. Equ, vol.25, pp.657-661, 1989.

J. Gustedt, On the pathwidth of chordal graphs, Discrete Applied Mathematics, vol.45, issue.3, pp.233-248, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00549556

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

P. Heggernes and R. Mihai, Mixed search number of permutation graphs, Proc. of Second Annual Int. Workshop on Frontiers in Algorithmics FAW, vol.5059, pp.196-207, 2008.

D. Ilcinkas, N. Nisse, and D. Soguet, The cost of monotonicity in distributed graph searching, Distributed Computing, vol.22, issue.2, pp.117-127, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00341415

N. Imani, H. Sarbazi-azad, and A. Y. Zomaya, Capturing an intruder in product networks, J. Parallel Distrib. Comput, vol.67, issue.9, pp.1018-1028, 2007.

N. Imani, H. Sarbazi-azad, and A. Y. Zomaya, Intruder capturing in mesh and torus networks, Int. J. Found. Comput. Sci, vol.19, issue.4, pp.1049-1071, 2008.

T. Johnson, N. Robertson, P. D. Seymour, and R. Thomas, Directed tree-width, J. Comb. Theory, Ser. B, vol.82, issue.1, pp.138-154, 2001.

N. G. Kinnersley, The vertex separation number of a graph equals its pathwidth, Inform. Process. Lett, 1992.

S. Kintali, N. Kothari, and A. Kumar, Approximation algorithms for digraph width parameters, Theor. Comput. Sci, vol.562, pp.365-376, 2015.

Y. +-16]-kenta-kitsunai, K. Kobayashi, H. Komuro, T. Tamaki, and . Tano, Computing directed pathwidth in o(1.89 n ) time. Algorithmica, vol.75, pp.138-157, 2016.

S. Kreutzer and S. Ordyniak, Digraph decompositions and monotonicity in digraph searching, Theor. Comput. Sci, vol.412, issue.35, pp.4688-4703, 2011.

M. Lefteris, C. H. Kirousis, and . Papadimitriou, Interval graphs and searching, Discrete Mathematics, vol.55, issue.2, pp.181-184, 1985.

M. Lefteris, C. H. Kirousis, and . Papadimitriou, Searching and pebbling, Theor. Comput. Sci, vol.47, issue.3, pp.205-218, 1986.

B. William, P. Kinnersley, and . Pralat, Game brush number, Discrete Applied Mathematics, vol.207, pp.1-14, 2016.

K. Klein and S. Suri, Pursuit evasion on polyhedral surfaces, Algorithmica, vol.73, issue.4, pp.730-747, 2015.

A. S. Lapaugh, Recontamination does not help to search a graph, J. ACM, vol.40, issue.2, pp.224-245, 1993.

F. Luccio, L. Pagli, and N. Santoro, Network decontamination with local immunization, Proc. of 20th Int. Parallel and Distributed Processing Symposium (IPDPS), 2006.

L. Flaminia and . Luccio, Contiguous search problem in sierpinski graphs, Theory Comput. Syst, vol.44, issue.2, pp.186-204, 2009.

S. Mallach, Linear ordering based MIP formulations for the vertex separation or pathwidth problem, Proc. of 28th Int. Workshop on Combinatorial Algorithms (IWOCA), vol.10765, pp.327-340, 2018.

S. L. +-88]-nimrod-megiddo, M. R. Hakimi, D. S. Garey, C. H. Johnson, and . Papadimitriou, The complexity of searching a graph, J. ACM, vol.35, issue.1, pp.18-44, 1988.

R. Mihai and M. Mjelde, A self-stabilizing algorithm for graph searching in trees, Proc. of 11th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol.5873, pp.563-577, 2009.

F. Mazoit and N. Nisse, Monotonicity of non-deterministic graph searching, Theor. Comput. Sci, vol.399, issue.3, pp.169-178, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00351481

M. Messinger, R. J. Nowakowski, and P. Pralat, Cleaning a network with brushes, Theor. Comput. Sci, vol.399, issue.3, pp.191-205, 2008.

E. Markou, N. Nisse, and S. Pérennes, Exclusive graph searching vs, pathwidth. Inf. Comput, vol.252, pp.243-260, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00980877

B. Monien and I. H. Sudborough, Min cut is np-complete for edge weighted trees, Theoretical Computer Science, vol.58, issue.1, pp.209-229, 1988.

R. Mihai and I. Todinca, Pathwidth is np-hard for weighted trees, Proc. of Third International Workshop on Frontiers in Algorithmics (FAW), vol.5598, pp.181-195
URL : https://hal.archives-ouvertes.fr/hal-00462314

. Springer, , 2009.

D. Meister, J. A. Telle, and M. Vatshelle, Recognizing digraphs of kelly-width 2, Discrete Applied Mathematics, vol.158, issue.7, pp.741-746, 2010.

J. Nesetril and P. Mendez, Grad and classes with bounded expansion i. decompositions, Eur. J. Comb, vol.29, issue.3, pp.760-776, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00007997

N. Nisse, Connected graph searching in chordal graphs, Discrete Applied Mathematics, vol.157, issue.12, pp.2603-2610, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00421414

N. Nisse, Algorithmic complexity: Between Structure and Knowledge How Pursuit-evasion Games help, 2014.
URL : https://hal.archives-ouvertes.fr/tel-00998854

N. Nisse and D. Soguet, Graph searching with advice, Theor. Comput. Sci, vol.410, issue.14, pp.1307-1318, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00421415

N. Nisse and R. Soares, On the monotonicity of process number, Discrete Applied Mathematics, vol.210, pp.103-111, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00745587

T. D. Parsons, Pursuit-evasion in a graph, International Conference on Theory and applications of graphs, vol.642, pp.426-441, 1978.

T. D. Parsons, The search number of a connected graph, 9th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Congress. Numer., XXI, pp.549-554, 1978.

N. N. Petrov, . Sheng-lung, C. Peng, T. Ho, M. Hsu et al., A problem of pursuit in the absence of information on the pursued, Theor. Comput. Sci, vol.18, issue.2, pp.429-446, 1982.

J. Penuel, J. C. Smith, and S. Shen, Integer programming models and algorithms for the graph decontamination problem with mobile agents, Networks, vol.61, issue.1, pp.1-19, 2013.

S. Peng, C. Y. Tang, M. Ko, C. Ho, and T. Hsu, Graph searching on some subclasses of chordal graphs, Algorithmica, vol.27, issue.3, pp.395-426, 2000.

S. Peng and Y. Yang, On the treewidth and pathwidth of biconvex bipartite graphs, Proc. of 4th Int. on Theory and Applications of Models of Computation, vol.4484, pp.244-255, 2007.

N. Robertson and P. D. Seymour, Graph minors. I. excluding a forest, J. Comb. Theory, Ser. B, vol.35, issue.1, pp.39-61, 1983.

N. Robertson and P. D. Seymour, Graph minors. IV. tree-width and well-quasi-ordering, J. Comb. Theory, Ser. B, vol.48, issue.2, pp.227-254, 1990.

N. Robertson and P. D. Seymour, Graph minors XIII. the disjoint paths problem, J. Comb. Theory, Ser. B, vol.63, issue.1, pp.65-110, 1995.

N. Robertson and P. D. Seymour, Graph minors. XX. wagner's conjecture, J. Comb. Theory, Ser. B, vol.92, issue.2, pp.325-357, 2004.

D. Richerby and D. M. Thilikos, Searching for a visible, lazy fugitive, SIAM J. Discrete Math, vol.25, issue.2, pp.497-513, 2011.

M. A. Safari, D-width: A more natural measure for directed tree width, 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), vol.3618, pp.745-756, 2005.

P. Shareghi, N. Imani, and H. Sarbazi-azad, Capturing an intruder in the pyramid, Proc. of First Int. Computer Science Symposium in Russia on Computer Science -Theory and Applications (CSR), vol.3967, pp.580-590, 2006.

K. Skodinis, Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time, J. Algorithms, vol.47, issue.1, pp.40-59, 2003.

D. Paul, R. Seymour, and . Thomas, Graph searching and a min-max theorem for tree-width, J. Comb. Theory, Ser. B, vol.58, issue.1, pp.22-33, 1993.

K. Suchan and I. Todinca, Pathwidth of circular-arc graphs, 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.4769, pp.258-269
URL : https://hal.archives-ouvertes.fr/hal-00462302

. Springer, , 2007.

K. Suchan and Y. Villanger, Computing pathwidth faster than 2 n, Proc. of 4th Int. Workshop on Parameterized and Exact Computation (IWPEC), vol.5917, pp.324-335, 2009.

D. Stanley and B. Yang, Lower bounds on fast searching, Proc. of 20th Int. Symposium on Algorithms and Computation (ISAAC), vol.5878, pp.964-973, 2009.

D. Stanley and B. Yang, Fast searching games on graphs, J. Comb. Optim, vol.22, issue.4, pp.763-777, 2011.

D. M. Thilikos, Algorithms and obstructions for linear-width and related search parameters, Discrete Applied Mathematics, vol.105, issue.1-3, pp.239-271, 2000.

A. Takahashi, S. Ueno, and Y. Kajitani, Mixed searching and proper-path-width, Theor. Comput. Sci, vol.137, issue.2, pp.253-268, 1995.

Y. Wu, P. Austrin, T. Pitassi, and D. Liu, Inapproximability of treewidth and related problems, J. Artif. Intell. Res, vol.49, pp.569-600, 2014.

Y. Xue and B. Yang, The fast search number of a cartesian product of graphs, Discrete Applied Mathematics, vol.224, pp.106-119, 2017.

Y. Xue, B. Yang, F. Zhong, and S. Zilles, Fast searching on complete k-partite graphs, Proc. of 10th Int. Conference on Combinatorial Optimization and Applications (COCOA), vol.10043, pp.159-174, 2016.

B. Yang, Strong-mixed searching and pathwidth, J. Comb. Optim, vol.13, issue.1, pp.47-59, 2007.

B. Yang, Fast edge searching and fast searching on graphs, Theor. Comput. Sci, vol.412, pp.1208-1219, 2011.

B. Yang, Fast-mixed searching and related problems on graphs, Theor. Comput. Sci, vol.507, pp.100-113, 2013.

B. Yang and Y. Cao, Directed searching digraphs: Monotonicity and complexity, Proc. of 4th International Conference Theory and Applications of Models of Computation (TAMC), vol.4484, pp.136-147, 2007.

B. Yang and Y. Cao, Monotonicity of strong searching on digraphs, J. Comb. Optim, vol.14, issue.4, pp.411-425, 2007.

B. Yang and Y. Cao, Digraph searching, directed vertex separation and directed pathwidth, Discrete Applied Mathematics, vol.156, issue.10, pp.1822-1837, 2008.

B. Yang and Y. Cao, Monotonicity in digraph search problems, Theor. Comput. Sci, vol.407, issue.1-3, pp.532-544, 2008.

B. Yang and Y. Cao, On the monotonicity of weak searching, Proc. of 14th Annual Int. Conference on Computing and Combinatorics (COCOON), vol.5092, pp.52-61, 2008.

B. Yang and Y. Cao, Standard directed search strategies and their applications, J. Comb. Optim, vol.17, issue.4, pp.378-399, 2009.

B. Yang, D. Dyer, and B. Alspach, Sweeping graphs with large clique number, Discrete Mathematics, vol.309, issue.18, pp.5770-5780, 2009.

B. Yang, R. Zhang, and Y. Cao, Searching cycle-disjoint graphs, Proc of first int. Conference on Combinatorial Optimization and Applications (COCOA), vol.4616, pp.32-43, 2007.