| J. Smith. Minimal trees of given search number. Discrete Mathematics, 66:191--202, 1987. |
....[21] stating that there is a minimal search strategy that does not recontaminate any link (see also [2] Thilikos [36] used graph minors to derive a linear time algorithm that checks whether a network has a search number at most 2. For other results on graph searching, the reader is referred to [7, 8, 12, 30, 32]. Contributions to related search problems can be found in [6, 25, 33, 34, 38, 39] and the references therein. 1.2 Limit of Existing Solutions In all existing solutions for the standard version of the problem (i.e. edge search) as well as for any of its variants known to the authors (e.g. ....
J. Smith. Minimal trees of given search number. Discrete Mathematics 66, 191-202, 1987.
.... on graph searching, we refer the reader to, e.g. 9, 12, 14, 15] Graph searching is a non trivial interesting and challenging problem; even determining whether s(G) k for arbitrary G and k, is NP complete [26] Not surprisingly, the research has focused on restricted classes of graphs (e.g. [19, 25, 27, 33, 34]) and on bounded search numbers (e.g. Departament de Matem atica Aplicada IV, Universitat Polit ecnica de Catalunya, Spain. lali mat.upc.es. CNRS, Laboratoire de Recherche en Informatique, Universit e Paris Sud, France. http: www.lri.fr pierre. School of Computer Science, Carleton ....
J. Smith. Minimal trees of given search number. Discrete Mathematics, 66:191-202, 1987.
No context found.
J. Smith. Minimal trees of given search number. Discrete Mathematics, 66:191--202, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC