Issue Date | Title | Author(s) |
2022-01-01 | Computing Significant Cliques in Large Labeled Networks | Qiu, YX; Wen, D; Li, RH; Qin, L; Yu, M; Lin, X |
2019-04-01 | Enumerating k-vertex connected components in large graphs | Wen, D; Qin, L; Zhang, Y; Chang, L; Chen, L |
2021-01-01 | On querying historical k-cores | Yu, M; Wen, D; Qin, L; Zhang, Y; Zhang, W; Lin, X |
2018-01-01 | K-connected cores computation in large dual networks | Yue, L; Wen, D; Cui, L; Qin, L; Zheng, Y |
2022-01-01 | Manipulating Structural Graph Clustering | Li, W; Gao, M; Wen, D; Zhou, H; Ke, C; Qin, L |
2019-06-01 | Efficient structural graph clustering: an index-based approach | Wen, D; Qin, L; Zhang, Y; Chang, L; Lin, X |
2019 | Fully Dynamic Depth-First Search in Directed Graphs. | Yang, B; Wen, D; Qin, L; Zhang, Y; Wang, X; Lin, X |
2021-01-01 | Span-reachability querying in large temporal graphs | Wen, D; Yang, B; Zhang, Y; Qin, L; Cheng, D; Zhang, W |
2021-01-01 | ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing | Wang, X; Wen, D; Qin, L; Chang, L; Zhang, Y; Zhang, W |
2023-11-01 | When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks | Ouyang, D; Wen, D; Qin, L; Chang, L; Lin, X; Zhang, Y |