Reachability and Time-Based Path Queries in Temporal Graphs
Refereed conference paper presented and published in conference proceedings


Full Text

Times Cited
Web of Science16WOS source URL (as at 15/08/2020) Click here for the latest count

Other information
AbstractA temporal graph is a graph in which vertices communicate with each other at specific time, e.g., A calls B at 11 a.m. and talks for 7 minutes, which is modeled by an edge from A to B with starting time "11 a.m." and duration "7 mins". Temporal graphs can be used to model many networks with time-related activities, but efficient algorithms for analyzing temporal graphs are severely inadequate. We study fundamental problems such as answering reachability and time-based path queries in a temporal graph, and propose an efficient indexing technique specifically designed for processing these queries in a temporal graph. Our results show that our method is efficient and scalable in both index construction and query processing.
All Author(s) ListWu HH, Huang YZ, Cheng J, Li JF, Ke YP
Name of Conference32nd IEEE International Conference on Data Engineering (ICDE)
Start Date of Conference16/05/2016
End Date of Conference20/05/2016
Place of ConferenceHelsinki
Country/Region of ConferenceFinland
Year2016
Month1
Day1
PublisherIEEE
Pages145 - 156
eISBN978-1-5090-2020-1
ISSN1084-4627
LanguagesEnglish-United Kingdom
Web of Science Subject CategoriesComputer Science; Computer Science, Information Systems; Computer Science, Theory & Methods; Engineering; Engineering, Electrical & Electronic

Last updated on 2020-15-08 at 23:09