Skip to main content
Fig. 4 | Applied Network Science

Fig. 4

From: Temporal network compression via network hashing

Fig. 4

From a 5 nodes temporal network, several hashed version are computed with 3 nodes each. Then, every hashed graph can be used to compute a small component matrix thanks to our matrix algorithm. Finally, the different component matrices can be fused to compute an approximate solution of the component matrix of the initial temporal network

Back to article page