Worst-Case Optimal BGPs on Temporal Graphs

Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro +1

We study how to evaluate basic graph patterns (BGPs) in a worst-case-optimal (wco) manner over {\em temporal} labeled graphs, where edges have an interval of temporal validity. We…