Fig. 4
From: Clone temporal centrality measures for incomplete sequences of graph snapshots
Example for the algorithm procedure of REN. A DTG representation of a graph sequence \(\mathcal {G}=G_{1},\ldots,G_{6}\) in (a). The six reversed DTGs in (b) demonstrate the stepwise query for shortest temporal paths γ 1,l,6(A,B) from A to B in a successively reversed graph sequence. Blue dashed edges indicate hops and halts that potentially are parts of shortest temporal paths. Red dashed edges indicate detected shortest temporal paths starting at a specific snapshot l