Answering Location-Aware Graph Reachability Queries on GeoSocial Data

2017 ◽  
Author(s):  
Mohamed Sarwat ◽  
Yuhan Sun
Keyword(s):  
Location Aware ◽  
Graph Reachability ◽  
Reachability Queries

BFSI-B: An improved K-hop graph reachability queries for cyber-physical systems

2017 ◽  
Vol 38 ◽  
pp. 35-42 ◽  
Author(s):  
Xia Xie ◽  
Xiaodong Yang ◽  
Xiaokang Wang ◽  
Hai Jin ◽  
Duoqiang Wang ◽  
...  
Keyword(s):  
Cyber Physical Systems ◽  
Physical Systems ◽  
Graph Reachability ◽  
Reachability Queries

REACHABILITY ON SUFFIX TREE GRAPHS

2008 ◽  
Vol 19 (01) ◽  
pp. 147-162
Author(s):  
YASUTO HIGA ◽  
HIDEO BANNAI ◽  
SHUNSUKE INENAGA ◽  
MASAYUKI TAKEDA
Keyword(s):  
Suffix Tree ◽  
Directed Acyclic Graphs ◽  
Time And Space ◽  
Worst Case ◽  
Expected Time ◽  
Tree Graphs ◽  
Acyclic Graphs ◽  
Computational Calculations ◽  
Graph Reachability ◽  
Reachability Queries

We analyze the complexity of graph reachability queries on ST-graphs, defined as directed acyclic graphs (DAGs) obtained by merging the suffix tree of a given string and its suffix links. Using a simplified reachability labeling algorithm presented by Agrawal et al. (1989), we show that for a random string of length n, its ST-graph can be preprocessed in O(n log n) expected time and space to answer reachability queries in O( log n) time. Furthermore, we present a series of strings that require [Formula: see text] time and space to answer reachability queries in O( log n) time for the same algorithm. Exhaustive computational calculations for strings of length n ≤ 33 have revealed that the same strings are also the worst case instances of the algorithm. We therefore conjecture that reachability queries can be answered in O( log n) time with a worst case time and space preprocessing complexity of [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document