TimeReach: Historical Reachability Queries on Evolving Graphs


Since most graphs evolve over time, it is useful to be able to query their history. We consider historical reachability queries that ask for the existence of a path in some time interval in the past, either in the whole duration of the interval (conjunctive queries), or in at least one time instant in the interval (disjunctive queries). We study both… (More)
DOI: 10.5441/002/edbt.2015.12

13 Figures and Tables



Citations per Year

Citation Velocity: 14

Averaging 14 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics