Efficient distributed reachability querying of massive temporal graphs

Efficient distributed reachability querying of massive temporal graphs

Reachability computation is a fundamental graph functionality with a wide range of applications. In spite of this, little work has as yet been done on efficient reachability queries over temporal graphs, which are used extensively to model time-varying networks, such as communication networks, socia...

Full description

Saved in:
Bibliographic Details
Main Authors: ZHANG, Tianming, GAO, Yunjun, LU, Chen, GUO, Wei, PU, Shiliang, ZHENG, Baihua, CHRISTIAN S. Jensen
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2019
Subjects:
Graph
Reachability
Distributed processing
Query processing
Algorithm
Computer Engineering
Theory and Algorithms
Online Access:https://ink.library.smu.edu.sg/sis_research/4468
https://ink.library.smu.edu.sg/context/sis_research/article/5471/viewcontent/DRQ_VLDBJ.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/4468
https://ink.library.smu.edu.sg/context/sis_research/article/5471/viewcontent/DRQ_VLDBJ.pdf

Similar Items