Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs - Archive ouverte HAL Access content directly
Journal Articles Algorithms Year : 2020

Dates and versions

hal-02999844 , version 1 (11-11-2020)

Identifiers

Cite

Pierluigi Crescenzi, Clémence Magnien, Andrea Marino. Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. Algorithms, 2020, 13 (9), pp.211. ⟨10.3390/a13090211⟩. ⟨hal-02999844⟩
30 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More