E Kanoulas, Y Du, T Xia… - … Conference on Data …, 2006 - ieeexplore.ieee.org
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a
user-defined leaving or arrival time interval I, a source node s and an end node e, allFP asks …