Apress

Spatio-temporal Networks

Modeling and Algorithms

By Betsy George , Sangho Kim

Spatio-temporal Networks Cover Image

  • ISBN13: 978-1-4614-4917-1
  • 85 Pages
  • User Level: Science
  • Publication Date: September 5, 2012
  • Available eBook Formats: PDF
  • eBook Price: $39.95
Buy eBook Buy Print Book Add to Wishlist
Full Description
Spatio-temporal networks (STN)are spatial networks whose topology and/or attributes change with time. These are encountered in many critical areas of everyday life such as transportation networks, electric power distribution grids, and social networks of mobile users. STN modeling and computations raise significant challenges. The model must meet the conflicting requirements of simplicity and adequate support for efficient algorithms. Another challenge is to address the change in the semantics of common graph operations, such as, shortest path computation assuming different semantics, or when temporal dimension is added. Also paradigms (e.g. dynamic programming) used in algorithm design may be ineffective since their assumptions (e.g. stationary ranking of candidates) may be violated by the dynamic nature of STNs. In recent years, STNs have attracted attention in research. New representations have been proposed along with algorithms to perform key STN operations, while accounting for their time dependence. Designing a STN database would require the development of data models, query languages, and indexing methods to efficiently represent, query, store, and manage time-variant properties of the network. The purpose of Spatio-temporal Networks: Modeling and Algorithms is to explore this design at the conceptual, logical, and physical level. Models used to represent STNs are explored and analyzed. STN operations, with an emphasis on their altered semantics with the addition of temporal dimension, are also addressed.
Table of Contents

Table of Contents

  1. Spatio
  2. temporal Networks: An Introduction.
  3. Time Aggregated Graph
  4. A model for Spatio
  5. temporal Networks.
  6. Shortest Path Algorithms for a Fixed Start Time.
  7. Best Start Time Journeys.
  8. Spatio
  9. temporal Network Applications.
Errata

If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.

* Required Fields

No errata are currently published