Efficient temporal graph processing : shortest paths, closeness centralities and S-cliques
Temporal graph is a data structure to represent a dynamic graph, where vertices and edges can change over time. Countless real-world systems can be modelled as temporal graphs, such as transportation networks and social networks. It enriches classic graph research by adding a new time dimension, whi...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis-Doctor of Philosophy |
| Language: | English |
| Published: |
Nanyang Technological University
2021
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/152573 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |