The Community for Technology Leaders
Green Image
Issue No. 11 - Nov. (2016 vol. 28)
ISSN: 1041-4347
pp: 2927-2942
Huanhuan Wu , Department of Computer Science and Engineering, Chinese University of Hong Kong, Shatin, NT, Hong Kong
James Cheng , Department of Computer Science and Engineering, Chinese University of Hong Kong, Shatin, NT, Hong Kong
Yiping Ke , School of Computer Engineering, Nanyang Technological University, Singapore
Silu Huang , Department of Computer Science and Engineering, Chinese University of Hong Kong, Shatin, NT, Hong Kong
Yuzhen Huang , Guangdong Province Key Laboratory of Big Data Analysis and Processing, Sun Yat-sen University, Guangzhou, China
Hejun Wu , Guangdong Province Key Laboratory of Big Data Analysis and Processing, Sun Yat-sen University, Guangzhou, China
ABSTRACT
Shortest path is a fundamental graph problem with numerous applications. However, the concept of classic shortest path is insufficient. In this paper, we study various concepts of “shortest” path in temporal graphs, called minimum temporal paths. Computing these minimum temporal paths is challenging as subpaths of a “shortest” path may not be “shortest” in a temporal graph. We propose efficient algorithms to compute minimum temporal paths and verified their efficiency using large real-world temporal graphs.
INDEX TERMS
Algorithm design and analysis, Heuristic algorithms, Electronic mail, Social network services, Parallel algorithms, Message service, Clustering algorithms
CITATION

H. Wu, J. Cheng, Y. Ke, S. Huang, Y. Huang and H. Wu, "Efficient Algorithms for Temporal Path Computation," in IEEE Transactions on Knowledge & Data Engineering, vol. 28, no. 11, pp. 2927-2942, 2016.
doi:10.1109/TKDE.2016.2594065
289 ms
(Ver 3.3 (11022016))