Algorithms with proofs and complexity bounds are given for distances, latencies, and shortest fastest paths in link streams to enable centrality computations.
Gender homophily from spatial behavior in a primary school: A sociometric study.Social Networks, 35(4):604 – 613
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.