| 982 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.0001283311 |
| 3,254 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
7.5928992e-05 |
| 3,337 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
7.5072753e-05 |
| 4,143 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.8760066e-05 |
| 5,133 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
6.3533812e-05 |
| 5,208 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
6.3165129e-05 |
| 5,374 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
6.2418958e-05 |
| 5,556 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
6.1751704e-05 |
| 5,913 |
Efficient Estimation of Heat Kernel PageRank for Local Clustering |
2019 |
SIGMOD |
6.0439971e-05 |
| 6,156 |
QTCS: Efficient Query-Centered Temporal Community Search |
2024 |
VLDB |
5.9560993e-05 |
| 6,268 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
5.9336489e-05 |
| 6,284 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
5.927015e-05 |
| 6,409 |
On Density-based Local Community Search |
2024 |
PODS |
5.8841661e-05 |
| 6,469 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5.8710857e-05 |
| 7,094 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
5.7055799e-05 |
| 7,861 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
5.5302333e-05 |
| 8,062 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
5.4949527e-05 |
| 8,911 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
5.3483178e-05 |
| 9,046 |
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor |
2026 |
SIGMOD |
5.3251649e-05 |
| 9,190 |
Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach |
2024 |
VLDB |
5.3058708e-05 |
| 9,387 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
5.2755515e-05 |
| 9,553 |
Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs |
2025 |
VLDB |
5.2528121e-05 |
| 9,689 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
5.2351259e-05 |
| 9,769 |
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs |
2025 |
SIGMOD |
5.2209769e-05 |
| 10,100 |
Parallel Colorful h-star Core Maintenance in Dynamic Graphs |
2023 |
VLDB |
5.1488731e-05 |
| 10,328 |
Scaling Up k-Clique Percolation Community Detection |
2026 |
SIGMOD |
5.093636e-05 |
| 10,332 |
The Power of Core Clique Removal for Exact Clique Enumeration |
2026 |
SIGMOD |
5.093636e-05 |
| 10,366 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
5.093636e-05 |
| 10,370 |
Fast Optimal Group Steiner Tree Search using GPUs |
2026 |
SIGMOD |
5.093636e-05 |
| 10,407 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
5.093636e-05 |
| 10,560 |
Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs |
2026 |
VLDB |
5.093636e-05 |
| 10,671 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
5.093636e-05 |
| 10,767 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
5.093636e-05 |
| 10,817 |
OpenFGL: A Comprehensive Benchmark for Federated Graph Learning |
2025 |
VLDB |
5.093636e-05 |
| 10,857 |
Truss Decomposition in Hypergraphs |
2025 |
VLDB |
5.093636e-05 |
| 11,173 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
5.093636e-05 |
| 11,198 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
5.093636e-05 |
| 11,256 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
5.093636e-05 |
| 11,292 |
FedGTA: Topology-aware Averaging for Federated Graph Learning |
2024 |
VLDB |
5.093636e-05 |
| 11,463 |
Approximating Probabilistic Group Steiner Trees in Graphs |
2023 |
VLDB |
5.093636e-05 |
| 13,356 |
LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning |
2024 |
VLDB |
- |