Database Paper Browser

Back to papers

Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation

Summary: UnderGS targets DTDG representation learning by replacing per-snapshot O(T|V|^2) adjacency storage with a GPU-resident temporal-cohesive neighbor store, maintaining only influential temporal neighbors via a temporal influence score. Lightweight, model-agnostic pipeline (MPNN/non-MPNN) with late-snapshot gradient aggregation; up to 9x faster, +31% accuracy. (summarized by gpt-5.4-mini on Apr 12 2026)

Paper ID
14365
Venue
VLDB
Year
2026
Pagerank
4.1945683e-05
Overall Rank
10,322 | 28.20%
DOI
10.14778/3796195.3796201

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers