Before revision:  With an open-source implementation  we demonstrate that the algorithm can scale to large temporal graphs with tens of millions of edges, despite the problem being NP-hard.
After revision:  With an open-source implementation we demonstrate that our algorithm scales to large graphs with up to one billion temporal edges, despite the problem being NP-hard.