relation: http://miis.maths.ox.ac.uk/miis/169/
title: Adapting Search Theory to Networks
creator: Alspach, Brian
subject: Information and communication technology
description: The 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.
date: 2001
type: Study Group Report
type: NonPeerReviewed
format: application/pdf
language: en
identifier: http://miis.maths.ox.ac.uk/miis/169/1/search_theory.pdf
identifier:   Alspach, Brian  (2001) Adapting Search Theory to Networks.  [Study Group Report]