Algorithms with proofs and complexity bounds are given for distances, latencies, and shortest fastest paths in link streams to enable centrality computations.
Computing shortest, fastest, and foremost journeys in dynamic networks.International Journal of Foundations of Computer Science, 14(02):267–285
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On computing distances and latencies in Link Streams
Algorithms with proofs and complexity bounds are given for distances, latencies, and shortest fastest paths in link streams to enable centrality computations.