The MIIS Eprints Archive: No conditions. Results ordered -Date Deposited. 2021-08-05T15:47:58ZEPrintshttp://miis.maths.ox.ac.uk/images/sitelogo.gifhttp://miis.maths.ox.ac.uk/miis/2008-10-10Z2015-05-29T19:48:36Zhttp://miis.maths.ox.ac.uk/miis/id/eprint/169This item is in the repository with the URL: http://miis.maths.ox.ac.uk/miis/id/eprint/1692008-10-10ZAdapting Search Theory to NetworksThe CSE is interested in the general problem of locating objects in networks. Because of their exposure to search theory, the problem they brought to the workshop was phrased in terms of adapting search theory to networks. Thus, the first step was the introduction of an already existing healthy literature on searching graphs.

T. D. Parsons, who was then at Pennsylvania State University, was approached in 1977 by some local spelunkers who asked his aid in optimizing a search for someone lost in a cave in Pennsylvania. Parsons quickly formulated the problem as a search problem in a graph. Subsequent papers led to two divergent problems. One problem dealt with searching under assumptions of fairly extensive information, while the other problem dealt with searching under assumptions of essentially zero information. These two topics are developed in the next two sections.Brian Alspach