Shortest Paths In Interval Temporal Graphs

We develop a polynomial time algorithm for the single source all destinations shortest paths problem for Interval Temporal Graphs (ITGs). While a polynomial time algorithm for this problem is known for Contact Sequence Temporal Graphs (CSGs), no such prior algorithm is known for ITGs. We benchmark our ITG algorithm against that for CSGs using datasets that can be solved using either algorithm. On synthetic datasets, our algorithm for ITGs obtains a speedup of up to 32.5 relative to the state-of-the-art algorithm for CSGs.