Name
Title | ||
|---|---|---|
Efficient Processing of Reachability and Time-Based Path Queries in a Temporal Graph. |
Abstract | ||
|---|---|---|
A temporal graph is a graph in which vertices communicate with each other at specific time, e.g., $A$ calls $B$ at and talks for 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. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Databases | Graph operations,Block graph,Comparability graph,Graph property,Computer science,Theoretical computer science,Implicit graph,Null graph,Pathwidth,Graph (abstract data type) |
DocType | Volume | Citations |
Journal | abs/1601.05909 | 0 |
PageRank | References | Authors |
0.34 | 24 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huanhuan Wu | 1 | 32 | 3.93 |
| Yuzhen Huang | 2 | 183 | 12.97 |
| James Cheng | 3 | 2044 | 101.89 |
| Jinfeng Li | 4 | 24 | 2.14 |
| Yiping Ke | 5 | 1056 | 46.24 |