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
URL : http://doi.org/10.1016/j.jctb.2006.12.006
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
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
Monotonicity in graph searching, Journal of Algorithms, vol.12, issue.2, pp.239-245, 1991. ,
DOI : 10.1016/0196-6774(91)90003-H
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
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
Rerouting requests in wdm networks, AlgoTel'05, pp.17-20, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00429173
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
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
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
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
Are There Any Good Digraph Width Measures?, 5th International Symposium on Parameterized and Exact Computation (IPEC), pp.135-146, 2010. ,
DOI : 10.1007/11549345_64
URL : http://arxiv.org/abs/1004.1485
Losing the +1: Directed path-width games are monotone, 2006. ,
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
URL : http://doi.org/10.1016/j.tcs.2008.02.038
Directed Tree-Width, Journal of Combinatorial Theory, Series B, vol.82, issue.1, pp.138-154, 2001. ,
DOI : 10.1006/jctb.2000.2031
URL : http://doi.org/10.1006/jctb.2000.2031
Searching and pebbling, Theoretical Computer Science, vol.47, issue.2, pp.205-218, 1986. ,
DOI : 10.1016/0304-3975(86)90146-5
URL : http://doi.org/10.1016/0304-3975(86)90146-5
Digraph decompositions and monotonicity in digraph searching. CoRR, abs/0802, 2008. ,
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
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
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
A mixed-integer programing formulation for the lightpath reconfiguration problem, VIII Workshop on G/MPLS Networks, 2009. ,
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
Digraph Strong Searching: Monotonicity and Complexity, AAIM, pp.37-46, 2007. ,
DOI : 10.1007/978-3-540-72870-2_4
On the Monotonicity of Weak Searching, COCOON, pp.52-61, 2008. ,
DOI : 10.1007/978-3-540-69733-6_6
Sweeping graphs with large clique number, Meeting in Celebration of Pavol Hells 60th Birthday)</ce:title>. Inria RESEARCH CENTRE SOPHIA ANTIPOLIS ? MÉDITERRANÉE 2004 route des Lucioles -BP 93, pp.5770-5780, 2006. ,
DOI : 10.1016/j.disc.2008.05.033
URL : http://dx.doi.org/10.1016/j.disc.2008.05.033