Efficient index structures for reachability and shortest path queries
Graphs are a fundamental data structure to represent objects and their relations in various domains, e.g., social science, citation analysis, web link analysis, and navigation systems. Reachability and shortest path queries are two types of primitive and well-studied graph queries. In this thesis, w...
Saved in:
主要作者: | Wang, Sibo |
---|---|
其他作者: | Xiao Xiaokui |
格式: | Theses and Dissertations |
語言: | English |
出版: |
2016
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/68898 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Energy-Efficient Shortest Path Query Processing on Air
由: JING, Yinan, et al.
出版: (2011) -
DBL: Efficient reachability queries on dynamic graphs
由: LYU, Qiuyi, et al.
出版: (2021) -
Constrained Shortest Path Computation
由: TERROVITIS, Manolis, et al.
出版: (2005) -
Shortest path and distance queries on road networks : an experimental evaluation
由: Wu, Lingkun, et al.
出版: (2013) -
Accelerating exact constrained shortest paths on GPUs
由: LU, Shengliang, et al.
出版: (2020)