You are seeing reference results for tree search for an immobile hider because there's not a match on Dictionary.com.
|
www.maths.lse.ac.uk/Personal/stengel/TEXTE/graphsearch....
www.maths.lse.ac.uk/Personal/stengel/TEXTE/graphsearch.pdf
|
We study the computational complexity of certain search-hide games on a graph. There are two players, called searcher and hider. The hider is immobile and ...
|
Network search games with immobile hider, without a designated searcher starting ... where G is a tree, and by Alpern for trees with Eulerian networks attached.
|
|
www.inf.ethz.ch/personal/stengel/TEXTE/graphsearch.ps.g...
www.inf.ethz.ch/personal/stengel/TEXTE/graphsearch.ps.gz
|
hider is immobile and hides in one of the nodes of the graph. ..... graph G is always uniformly searchable using any spanning tree as search path. The. argument ...
|
|
or.journal.informs.org/content/59/5/1258.abstract
|
When Q is a binary tree, we derive optimal probabilities for the Searcher to branch at the nodes. ... Search games with mobile and immobile hider. SIAM J.
|
|
citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.38.54...
citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.38.5428&rep=rep1&type=ps
|
FAX (510) 643-7684. Complexity of Searching. an Immobile Hider in a Graph. Bernhard von Stengel and Ralph Werchner. TR-95-044. August 22, 1995 ...
|
|
onlinelibrary.wiley.com/doi/10.1002/net.3230200703/pdf
|
In the case that Q is a tree, Gal proved that V = I?, and he described an optimal strategy for the ... SEARCH GAME ON NETWORK WITH IMMOBILE HIDER. 819 ...
|
|
|
|
stat.haifa.ac.il/~s.gal/search%20course/optimalitygraph...
stat.haifa.ac.il/~s.gal/search%20course/optimalitygraph.pdf
|
Abstract. Consider a search game with an immobile hider in a graph. A Chinese ... weakly Eulerian (i.e it consists of several Eulerian curves connected in a tree- ...
|
|
dl.acm.org/citation.cfm?id=273859.273879
|
Complexity of searching an immobile hider in a graph ... Bibliometrics: publication history .... k -path partitions in trees · Jing-Ho Yan, Gerard J. Chang, Sandra M.
|
|
www.sciencedirect.com/science/article/pii/S037722170700...
www.sciencedirect.com/science/article/pii/S0377221707009034
|
We focus our literature search on just the case of an immobile hider and then ... if and only if Q is Eulerian and the upper value is attained when Q is a tree.
|
|
www.jstor.org/stable/3088498
|
(1) for this specific problem. The problem dealt with here generalizes the c = 0 " search game with immobile hider on a tree" that was solved in Gal (1980) and ...
|
