GPU Algorithm for Earliest Arrival Time Problem in Public Transport Networks

Chirayu Anant Haryan, G. Ramakrishna, Rupesh Nasre +1

Given a temporal graph G, a source vertex s, and a departure time at source vertex t_s, the earliest arrival time problem EAT is to start from s on or after t_s and reach all the v…