Issue Date | Title | Author(s) |
2021 | FAST: FPGA-based Subgraph Matching on Massive Graphs. | Jin, X; Yang, Z; Lin, X; Yang, S; Qin, L; Peng, Y |
2015-11-03 | Effective and efficient: Large-scale dynamic city express | Zhang, S; Qin, L; Zheng, Y; Cheng, H |
2020-05-27 | Speeding Up GED Verification for Graph Similarity Search | Chang, L; Feng, X; Lin, X; Qin, L; Zhang, W; Ouyang, D |
2022-01-01 | Manipulating Structural Graph Clustering | Li, W; Gao, M; Wen, D; Zhou, H; Ke, C; Qin, L |
2018-01-01 | Discovering strong communities with user engagement and tie strength | Zhang, F; Yuan, L; Zhang, Y; Qin, L; Lin, X; Zhou, A |
2020-05-27 | StructSim: Querying Structural Node Similarity at Billion Scale | Chen, X; Lai, L; Qin, L; Lin, X |
2008-05-16 | Finding time-dependent shortest paths over large graphs | Ding, B; Yu, JX; Qin, L |
2020-08-01 | Answering Top-κ Graph Similarity Queries in Graph Databases | Zhu, Y; Qin, L; Yu, JX; Cheng, H |
2019 | A Survey and Experimental Analysis of Distributed Subgraph Matching. | Lai, L; Qing, Z; Yang, Z; Jin, X; Lai, Z; Wang, R; Hao, K; Lin, X; Qin, L; Zhang, W; Zhang, Y; Qian, Z; Zhou, J |
2017-01-01 | Efficient local clustering coefficient estimation in massive graphs | Zhang, H; Zhu, Y; Qin, L; Cheng, H; Yu, JX |