Affiliation:
1. National University of Defense Technology, Changsha, China
Funder
National Natural Science Foundation of China
Tianjin Science and Technology Foundation
Natural Science Foundation of Hunan Province
National Program for Support of Top-Notch Young Professionals of National Program for Special Support of Eminent Professionals
Reference5 articles.
1. Efficient Subgraph Matching by Postponing Cartesian Products
2. Taming verification hardness
3. Shixuan Sun and Qiong Luo. 2019. Scaling Up Subgraph Query Processing with Efficient Subgraph Matching. In ICDE. 220--231. Shixuan Sun and Qiong Luo. 2019. Scaling Up Subgraph Query Processing with Efficient Subgraph Matching. In ICDE. 220--231.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献