.png){kind=icon}
.png){kind=icon}
Return
Efficient Algorithms for Temporal Path Computation
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2016.2594065.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Temporal graphs
temporal path
parallel temporal path algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.7K
Citations:
3.2W
Organization
View more organizations