F. Fomin and P. Golovach. Graph searching and interval completion. SIAM Journal on Discrete Mathematics, 13(4):454--464, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Capture of an Intruder by Mobile Agents - Barrière, Flocchini.. (2002) (2 citations) (Correct)
....[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. ....
F. Fomin and P. Golovach. Graph searching and interval completion. SIAM Journal on Discrete Mathematics 13(4), 454-464, 2000.
Contiguous and Internal Graph Searching - Barriere, Fraigniaud, Santoro.. (2002) (Correct)
.... a graph is equal to its pathwidth plus one, and also to its vertex separator plus one [18, 19, 20] The inert search number is equal to the treewidth plus one [10, 32] and the mixed search number is equal to the proper pathwidth [38, 39] For more 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. ....
F. Fomin and P. Golovach. Graph searching and interval completion. SIAM Journal on Discrete Mathematics, 13(4):454-464, 2000.
Graph Searching, Elimination Trees, And A Generalization.. - Fomin, Heggernes, Telle (2003) Self-citation (Fomin) (Correct)
No context found.
F. V. Fomin and P. A. Golovach, Graph searching and interval completion, SIAM J. Discrete Math., 13 (2000), pp. 454--464 (electronic).
Graph Searching, Elimination Trees, and a Generalization.. - Fomin, Heggernes, Telle (2003) Self-citation (Fomin) (Correct)
No context found.
F. V. Fomin and P. A. Golovach, Graph searching and interval completion, SIAM J. Discrete Math., 13 (2000), pp. 454--464 (electronic).
Graph Searching, Elimination Trees, and a Generalization.. - Fomin, Heggernes, Telle Self-citation (Fomin) (Correct)
....certain pebble games [15] that model sequential computation. Other applications of graph searching can be found in VLSI theory since this gametheoretic approach to some important parameters of graph layouts such as the cutwidth [19] the topological bandwidth [18] the bandwidth [9] the pro le [10], and the vertex separation number [8] is very useful for the design of ecient algorithms. There is also a connection between graph searching, pathwidth and treewidth, parameters that play an important role in the theory of graph minors developed by Robertson Seymour [3, 7, 22] Furthermore, ....
....to move only just before a searcher is placed on the vertex it occupies. The smallest number of searchers needed to nd the fugitive in this version of searching is related to the parameter called treewidth [7] Another criteria of optimality in node searching, namely search cost was studied in [10]. Here the goal is to minimize the sum of the number of searchers in use over all moves of the search program. The search cost of a graph is equal to the interval completion number, or pro le, which is the smallest number of edges in any interval supergraph of the given graph. Looking at the ....
[Article contains additional citation context not shown here]
F. V. Fomin and P. A. Golovach, Graph searching and interval completion, SIAM J. Discrete Math., 13 (2000), pp. 454-464 (electronic).
Connected and Internal Graph Searching - Barriere, Fraigniaud, Santoro.. (Correct)
No context found.
F. Fomin and P. Golovach. Graph searching and interval completion. SIAM Journal on Discrete Mathematics, 13(4):454--464, 2000.
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