References

Bibliography for the STRATA Paper

← Back to Home

AORM Family

[1] S.-S. Kim, Y.-K. Kim, Y.-M. Kang — AORM: Fast Incremental Arbitrary-Order Reachability Matrix Computation for Massive Graphs — IEEE Access, 2021
[2] S.-S. Kim, Y.-M. Kang, Y.-K. Kim — Sparsity-Aware Reachability Computation for Massive Graphs — IEEE BigComp, 2022
[3] S.-S. Kim, M. Chung — Fast Graph Learning for Traffic Prediction — IEEE Big Data, 2023

Applications

[4] S.-S. Kim et al. — Urban Traffic Prediction Using Congestion Diffusion Model — IEEE ICCE-Asia, 2020
[5] A. Kapoor et al. — COVID-19 Forecasting Using Spatio-Temporal GNN — arXiv, 2020
[6] Z. Zhang et al. — Arbitrary-Order Proximity Preserved Network Embedding — KDD, 2018
[7] M. E. J. Newman — Modularity and Community Structure in Networks — PNAS, 2006

APSP Algorithms

[8] R. W. Floyd — Algorithm 97: Shortest Path — Commun. ACM, 1962
[9] R. Seidel — On the All-Pairs-Shortest-Path Problem — JCSS, 1995
[10-13] GraphBLAS, LAGraph, Boolean SpGEMM, Bit-packing
[14-17] GPU BFS, Delta-stepping, cuGraph, Gunrock

GNN and Positional Encoding

[18] V. P. Dwivedi, X. Bresson — Laplacian Positional Encoding — AAAI-W, 2021
[19] V. P. Dwivedi et al. — Random Walk Positional Encoding (RWPE) — ICLR, 2022
[22] L. Rampášek et al. — GraphGPS — NeurIPS, 2022
[25-26] Over-squashing (Topping, Di Giovanni)

Dynamic Graphs

[30-32] Dynamic SSSP/Reachability (van den Brand, Bernstein)
[33] J. You et al. — ROLAND: Graph Learning for Dynamic Graphs — KDD, 2022
[34-35] DyGFormer, TGB

Network Science