Adapting Search Theory to Networks

Alspach, Brian (2001) Adapting Search Theory to Networks. Canadian Industrial Problem Solving Workshops > 5th IPSW [Seattle 18/5/2001 - 22/5/2001].

Full text available as:

PDF - Requires Adobe Acrobat Reader or other PDF viewer.

Abstract/Summary

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
Study Group:	Canadian Industrial Problem Solving Workshops > 5th IPSW [Seattle 18/5/2001 - 22/5/2001]
Company Name:	Communication Security Communication Security Establishment
Industrial Sector:	Information and communication technology
Additional Contributors:	Jaskie, Kristen and Kolokolnikov, Theodore and Kosygin, Denis and Krislock, Nathan and Li, Aihna and Li, Jacky and Nosal, Eva-Marie and Rosenfeld, Moshe and Sumner, Sarah and Zhao, Ling
ID Code:	169
Deposited By:	Michele Taroni
Deposited On:	10 October 2008

Problem Statement

The Communication Security Establishment is interested in the general problem of locating objects in networks. Their interest in this type of problem arises because of the emerging concern regarding security issues for information operations.

Archive Staff Only: edit this record