Efficient Algorithms for Temporal Path Computation
Publication in refereed journal

Full Text

Times Cited
Web of Science1WOS source URL

Other information
AbstractShortest 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.
All Author(s) ListHuanhuan Wu, James Cheng, Yiping Ke, Silu Huang, Yuzhen Huang, Hejun Wu
Journal nameIEEE Transactions on Knowledge and Data Engineering
Volume Number28
Issue Number11
Pages2927 - 2942
LanguagesEnglish-United States
KeywordsAlgorithm design and analysis, Heuristic algorithms, Electronic mail, Social network services, Parallel algorithms, Message service, Clustering algorithms

Last updated on 2018-14-02 at 17:10