| 1,007 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.00012556573 |
| 3,318 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
7.4324312e-05 |
| 3,376 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
7.3590905e-05 |
| 4,224 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.7217275e-05 |
| 4,526 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
6.5606177e-05 |
| 4,732 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
6.4461271e-05 |
| 5,277 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
6.1999805e-05 |
| 5,336 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
6.1747873e-05 |
| 5,500 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
6.1028678e-05 |
| 5,531 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
6.0935114e-05 |
| 5,552 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
6.0860432e-05 |
| 6,033 |
Efficient Estimation of Heat Kernel PageRank for Local Clustering |
2019 |
SIGMOD |
5.9093593e-05 |
| 6,289 |
QTCS: Efficient Query-Centered Temporal Community Search |
2024 |
VLDB |
5.8224604e-05 |
| 6,403 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
5.7963998e-05 |
| 6,542 |
On Density-based Local Community Search |
2024 |
PODS |
5.7521412e-05 |
| 8,020 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
5.4061498e-05 |
| 8,226 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
5.3740319e-05 |
| 8,419 |
Truss Decomposition in Hypergraphs |
2025 |
VLDB |
5.3350162e-05 |
| 8,629 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
5.2994494e-05 |
| 9,220 |
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor |
2026 |
SIGMOD |
5.2056825e-05 |
| 9,370 |
Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach |
2024 |
VLDB |
5.1868213e-05 |
| 9,571 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
5.1571823e-05 |
| 9,731 |
Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs |
2025 |
VLDB |
5.1349531e-05 |
| 9,865 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
5.1176637e-05 |
| 9,915 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
5.1103839e-05 |
| 9,947 |
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs |
2025 |
SIGMOD |
5.1038322e-05 |
| 10,256 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
5.050482e-05 |
| 10,327 |
Parallel Colorful h-star Core Maintenance in Dynamic Graphs |
2023 |
VLDB |
5.0333462e-05 |
| 10,537 |
The Power of Core Clique Removal for Exact Clique Enumeration |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,564 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,568 |
Fast Optimal Group Steiner Tree Search using GPUs |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,599 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,742 |
Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs |
2026 |
VLDB |
4.9793485e-05 |
| 10,829 |
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search |
2026 |
VLDB |
4.9793485e-05 |
| 10,860 |
Maximum Defective Biclique Search in Large Bipartite Graphs |
2026 |
VLDB |
4.9793485e-05 |
| 11,112 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
4.9793485e-05 |
| 11,226 |
OpenFGL: A Comprehensive Benchmark for Federated Graph Learning |
2025 |
VLDB |
4.9793485e-05 |
| 11,518 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.9793485e-05 |
| 11,540 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
4.9793485e-05 |
| 11,614 |
FedGTA: Topology-aware Averaging for Federated Graph Learning |
2024 |
VLDB |
4.9793485e-05 |
| 11,775 |
Approximating Probabilistic Group Steiner Trees in Graphs |
2023 |
VLDB |
4.9793485e-05 |
| 13,673 |
LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning |
2024 |
VLDB |
- |