Searching symmetric networks with Utilitarian-Postman paths
From MaRDI portal
Publication:3057096
DOI10.1002/net.20314zbMath1208.05143MaRDI QIDQ3057096
Shmuel Gal, Vic Baston, Steven Alpern
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20314
05C90: Applications of graph theory
90B40: Search theory
91A43: Games involving graphs
91A24: Positional games (pursuit and evasion, etc.)
Related Items
Search games on networks with travelling and search costs and with arbitrary searcher starting points, Search for an immobile entity on a network, A competitive search game with a moving target, Search and delivery man problems: when are depth-first paths optimal?, Online failure diagnosis in interdependent networks, Search for an immobile hider on a stochastic network, Search for an immobile hider in a known subset of a network, Search games on a network with travelling and search costs, Static search games played over graphs and general metric spaces, Hide-and-seek games on a tree to which Eulerian networks are attached
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network search games with immobile hider, without a designated searcher starting point
- Complexity of searching an immobile hider in a graph
- The theory of search games and rendezvous.
- Search games and other applications of game theory
- On edge-disjoint spanning trees in hypercubes
- Son of the linear search problem
- Search games with immobile hider
- Network search games, with arbitrary searcher starting point
- Hide-and-seek games on a tree to which Eulerian networks are attached
- The search game on a network with immobile hider
- The search value of a network
- A Mixed-Strategy Minimax Theorem without Compactness
- Arc Routing Problems, Part I: The Chinese Postman Problem
- A SEARCH GAME WITH TRAVELING COST ON A TREE
- Alternating search at two locations
