No abstract

Analyzing the vulnerability of a network and identifying its critical spots is of great importance for today's decision makers. The in‐depth knowledge about the underlying network and its efficiency is fundamental to adequate decision making. In this paper, the flow‐weighted efficiency measure is introduced and exemplarily demonstrated on a physical network—the underground network of Munich, Germany. This paper addresses the usability of the weight values of a graph from an efficiency point of view. The proposed measure calculates the flow‐weighted efficiency in a subway network by computing the shortest route between every pair of stations and the according bottleneck flow of the trains. Results show that the network efficiency is invariant over all schedules, whereas the flow‐weighted efficiency is significantly varying according to the train schedules.

No abstract

No abstract

No abstract