Efficient Algorithms for Temporal Path Computation

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 c...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on knowledge and data engineering Ročník 28; číslo 11; s. 2927 - 2942
Hlavní autoři: Huanhuan Wu, Cheng, James, Yiping Ke, Silu Huang, Yuzhen Huang, Hejun Wu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.11.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithm design and analysis
Clustering algorithms
Electronic mail
Heuristic algorithms
Message service
Parallel algorithms
parallel temporal path algorithms
Social network services
Temporal graphs
temporal path
ISSN:1041-4347, 1558-2191
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2016.2594065