"Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs."

Pierluigi Crescenzi, Clémence Magnien, Andrea Marino (2020)

> Home

Details and statistics

DOI: 10.3390/A13090211

access: open

type: Journal Article

metadata version: 2023-06-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithms/CrescenziMM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithms/CrescenziMM20
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino:
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. Algorithms 13(9): 211 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.