Besides the size of the identified affected subgraphs, we analyse their temporal persistence at the example of Hanover.
This means that the affected subgraphs identified at time point \(i\)  (including the typical variations of these subgraphs, e.g. due to the propagation of the traffic load along the transportation graph) have to be recognised in the subsequent time steps. For this purpose, we apply an algorithm based on the Hungarian method [1]}. This algorithm aims to find an optimal assignment of clusters (i.e. affected subgraphs) in two consecutive time steps by minimising the assignment costs. In order to compute the assignment costs, the intersection of the affected units involved in each subgraph (cluster) in two subsequent time steps \(i\)  and \(j\)  is calculated as:
\(costs_{i,j} = ||c_i \cap c_j|| \ \ \ \forall c_i \in C_i, c_j \in C_j.\) 
