Hide‐and‐seek games on a tree to which Eulerian networks are attached
Author:
- 17 September 2008
- Vol. 52 (3) , 162-166
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The absolute center of a networkNetworks, 2004
- On the optimality of a simple strategy for searching graphsInternational Journal of Game Theory, 2001
- Alternating Search at Two LocationsDynamics and Control, 2000
- Generalizations in the linear search problemIsrael Journal of Mathematics, 1995
- Arc Routing Problems, Part I: The Chinese Postman ProblemOperations Research, 1995
- Search games with immobile hiderInternational Journal of Game Theory, 1993
- The search game on a network with immobile hiderNetworks, 1990
- The search value of a networkNetworks, 1985
- New Results on the Complexity of p-Centre ProblemsSIAM Journal on Computing, 1983
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973