From: Algorithms for optimal min hop and foremost paths in interval temporal graphs
Dataset | |V| | \(|E_{s}|\) | Wu-edges | Edge activity |
---|---|---|---|---|
Graphs with \(\mu _{I}=4, \mu _{D}=5, \mu _{T}=3\) | ||||
Youtube | 1157.8K | 4945K | 105,039K | 21.2 |
Flickr | 1861K | 22,613.9K | 480,172K | 21.24 |
Livejournal | 5284K | 77,402.6K | 1,643,438K | 21.3 |
Graphs with \(\mu _{I}=4, \mu _{D}=8, \mu _{T}=3\) | ||||
Youtube | 1157.8K | 4945K | 159,103.7K | 32.1 |
Flickr | 1861K | 22,613.9K | 727,405.9K | 32.1 |