The MIIS Eprints Archive

Adapting Search Theory to Networks

Alspach, Brian (2001) Adapting Search Theory to Networks. [Study Group Report]



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.

Item Type:Study Group Report
Problem Sectors:Information and communication technology
Study Groups:Canadian Industrial Problem Solving Workshops > IPSW 5 (Seattle, Canada, May 18-22, 2001)
Company Name:Communication Security Communication Security Establishment
ID Code:169
Deposited By: Michele Taroni
Deposited On:10 Oct 2008
Last Modified:29 May 2015 19:48

Repository Staff Only: item control page