On the optimality of a simple strategy for searching graphs

International Journal of Game Theory

Volumn 29, Issue 4, 2000, Pages 533-542

  Gal, Shmuel ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Chinese postman tour; Search game; Weakly cyclic graph; Weakly Eulerian graph

Indexed keywords

EID: 0039608445     PISSN: 00207276     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001820000056     Document Type: Article

References (8)

1. Alpern S, Gal S (To appear) Search games and rendezvous theory. Kluwer Academic Publishers, Boston
2. Edmonds J (1965) The Chinese postman problem. Bull. Oper. Res. Soc. Amer. 13, Suppl. 1. B-73
3. Edmonds J, Johnson EL (1973) Matching Euler tours and the Chinese postman problem. Math. Programming 5:88-124
4. Gal S (1980) Search games. Academic Press, New York
5. Isaacs R (1965) Differential games. John Wiley & Sons, New York
6. Reijnierse JH, Potters JAM (1993) Search games with immobile hider. Internat. J. Game Theory 21:385-394
7. Reijnierse JH, Potters JAM (1993) Private communication
8. Reijnierse JH (1995) Games, graphs and algorithms. Ph. D Thesis, University of Nijmegen, The Netherlands