Jul 2026
Worst-Case Optimal BGPs on Temporal Graphs
An index structure that, for a temporal graph with N edges, requires O(N) space and can evaluate extended BGPs in wco time and yields wco guarantees for related query types, including snapshot evaluation, version queries, and other temporal variants.
Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro et al.
· Proceedings of the VLDB Endo... · 0 citations