Temporal Reachability is a temporal graph metric that quantifies the extent to which a node can reach or be reached by other nodes over time within a dynamic network, accounting for the chronological ordering of edges.
34
Publications
1.8K
Citations
111
Authors
66
Institutions
Publications per year
2017–2026
17
Parents
Publications
34
Connectivity and inference problems for temporal networks
David Kempe, Jon Kleinberg, Amit Kumar · 2000 · 320 citations
Reachability and time-based path queries in temporal graphs
Huanhuan Wu, Yuzhen Huang, James Cheng et al. · 2016 · 105 citations
1–5 of 34
Authors
111
- YZ
3
h-index
- WZ
3
h-index
- LQ
3
h-index
- JK
2
h-index
- PM
2
h-index
1–5 of 111
Institutions
66
UNSW Sydney
Sydney, Australia
3 h-index
8 publications
300 citations
University of Technology Sydney
Sydney, Australia
3 h-index
9 publications
273 citations
Ames Research Center
Mountain View, United States
2 h-index
4 publications
206 citations
University of Liverpool
Liverpool, United Kingdom
2 h-index
2 publications
35 citations
Xidian University
Xi'an, China
2 h-index
6 publications
547 citations
Aalborg University
Aalborg, Denmark
2 h-index
4 publications
138 citations
Sorbonne Université
Paris, France
2 h-index
4 publications
283 citations
Zhejiang University
Hangzhou, China
1 h-index
3 publications
84 citations
1–8 of 66
Venues
- The VLDB Journal
2 publications · 43 citations
2
h-index
- Journal of Computer and System Sciences
2 publications · 304 citations
2
h-index
- Movebank
Repository · 1 publications · 36 citations
1
h-index
- IEEE Transactions on Systems Man and Cybernetics
1 publications · 21 citations
1
h-index
- Theoretical Computer Science
1 publications · 41 citations
1
h-index
1–5