Showing results 91 to 110 of 242
< previous
next >
| Issue Date | Title | Author(s) |
| 2021-01-01 | Efficiently answering reachability and path queries on temporal bipartite graphs | Chen, X; Wang, K; Lin, X; Zhang, W; Qin, L; Zhang, Y |
| 2020-05-27 | Efficiently Answering Span-Reachability Queries in Large Temporal Graphs | Wen, D; Huang, Y; Zhang, Y; Qin, L; Zhang, W; Lin, X |
| 2013-01-01 | Efficiently computing k-edge connected components via graph decomposition | Chang, L; Yu, JX; Qin, L; Lin, X; Liu, C; Liang, W |
| 2015-01-01 | Efficiently computing Top-K shortest path join | Chang, L; Lin, X; Qin, L; Yu, JX; Pei, J |
| 2018-10-24 | Efficiently reinforcing social networks over user engagement and tie strength | Zhang, F; Zhang, Y; Qin, L; Zhang, W; Lin, X |
| 2021 | EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search | Liu, W; Wang, H; Zhang, Y; Wang, W; Qin, L; Lin, X |
| 2019-01-01 | Enrichment of CD146(+) Adipose-Derived Stem Cells in Combination with Articular Cartilage Extracellular Matrix Scaffold Promotes Cartilage Regeneration | Li, X; Guo, W; Zha, K; Jing, X; Wang, M; Zhang, Y; Hao, C; Gao, S; Chen, M; Yuan, Z; Wang, Z; Zhang, X; Shen, S; Li, H; Zhang, B; Xian, H; Sui, X; Qin, L; Peng, J; Liu, S; Lu, S; Guo, Q |
| 2019-04-01 | Enumerating k-vertex connected components in large graphs | Wen, D; Qin, L; Zhang, Y; Chang, L; Chen, L |
| 2019 | Enumerating k-Vertex Connected Components in Large Graphs. | Wen, D; Qin, L; Zhang, Y; Chang, L; Chen, L |
| 2012-01-01 | The exact distance to destination in undirected world | Chang, L; Yu, JX; Qin, L; Cheng, H; Qiao, M |
| 2018-10-24 | Exacting eccentricity for small-world networks | Li, W; Qiao, M; Qin, L; Zhang, Y; Chang, L; Lin, X |
| 2020-04-01 | Exploring finer granularity within the cores: Efficient (k, p)-Core computation | Zhang, C; Zhang, F; Zhang, W; Liu, B; Zhang, Y; Qin, L; Lin, X |
| 2018-01-01 | External topological sorting in large graphs | Qing, Z; Yuan, L; Zhang, F; Qin, L; Lin, X; Zhang, W |
| 2013-05-01 | Fast Maximal Cliques Enumeration in Sparse Graphs | Chang, L; Yu, JX; Qin, L |
| 2017-05-16 | A fast order-based approach for core maintenance | Zhang, Y; Yu, JX; Qin, L |
| 2021-04-01 | FAST: FPGA-based subgraph matching on massive graphs | Jin, X; Yang, Z; Lin, X; Yang, S; Qin, L; Peng, Y |
| 2021 | FAST: FPGA-based Subgraph Matching on Massive Graphs. | Jin, X; Yang, Z; Lin, X; Yang, S; Qin, L; Peng, Y |
| 2017-01-01 | Finding critical users for social network engagement: The collapsed k-core problem | Zhang, F; Zhang, Y; Qin, L; Zhang, W; Lin, X |
| 2020-01-01 | Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems | Zhang, F; Li, C; Zhang, Y; Qin, L; Zhang, W |
| 2017-12-01 | Finding influential communities in massive networks | Li, RH; Qin, L; Yu, JX; Mao, R |
