Premium
Identifying Critical Locations in a Spatial Network with Graph Theory
Author(s) -
Demšar Urška,
Špatenková Olga,
Virrantaus Kirsi
Publication year - 2008
Publication title -
transactions in gis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.721
H-Index - 63
eISSN - 1467-9671
pISSN - 1361-1682
DOI - 10.1111/j.1467-9671.2008.01086.x
Subject(s) - interdiction , identification (biology) , spatial network , vulnerability (computing) , graph theory , computer science , metropolitan area , dual graph , geography , vulnerability assessment , network analysis , graph , dual (grammatical number) , data mining , theoretical computer science , computer security , mathematics , engineering , art , line graph , psychological resilience , psychotherapist , literature , archaeology , biology , psychology , geometry , botany , combinatorics , electrical engineering
Effective management of infrastructural networks in the case of a crisis requires a prior analysis of the vulnerability of spatial networks and identification of critical locations where an interdiction would cause damage and disruption. This article presents a mathematical method for modelling the vulnerability risk of network elements which can be used for identification of critical locations in a spatial network. The method combines dual graph modelling with connectivity analysis and topological measures and has been tested on the street network of the Helsinki Metropolitan Area in Finland. Based on the results of this test the vulnerability risk of the network elements was experimentally defined. Further developments are currently under consideration for eventually developing a risk model not only for one but for a group of co‐located spatial networks.