Abstract
Since the spatial search problem explicitly deals with alternatives distributed in two-dimensional space, we need a way to characterize the spatial layout of the problem. This links our problem to graph theory and the related theories of optimal routing and computational complexity. In this chapter we do not intend to provide a comprehensive introduction to any of these theories (for such an introduction see e.g. Gibbons, 1985; Parker and Rardin, 1988; Bondy and Murty, 1976). We will discuss only those aspects of these theories that are essential for our discussion of the spatial search problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Physica-Verlag Heidelberg
About this chapter
Cite this chapter
Maier, G. (1995). Prerequisites: Graphs, Routes, and Computational Complexity. In: Spatial Search. Studies in Contemporary Economics. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-49346-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-49346-1_3
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-0874-2
Online ISBN: 978-3-642-49346-1
eBook Packages: Springer Book Archive