| 1,007 |
Influential Community Search in Large Networks |
2015 |
VLDB |
31 |
0.00012550629 |
| 3,318 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
13 |
7.4289128e-05 |
| 3,376 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
14 |
7.3556068e-05 |
| 4,224 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
7 |
6.7185455e-05 |
| 4,527 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
9 |
6.557512e-05 |
| 4,733 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
8 |
6.4430756e-05 |
| 5,280 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
5 |
6.1970455e-05 |
| 5,343 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
7 |
6.1718642e-05 |
| 5,504 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
8 |
6.0999788e-05 |
| 5,534 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5 |
6.0906268e-05 |
| 5,554 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
7 |
6.0831622e-05 |
| 6,035 |
Efficient Estimation of Heat Kernel PageRank for Local Clustering |
2019 |
SIGMOD |
10 |
5.9065619e-05 |
| 6,292 |
QTCS: Efficient Query-Centered Temporal Community Search |
2024 |
VLDB |
7 |
5.8197041e-05 |
| 6,405 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
9 |
5.7936558e-05 |
| 6,544 |
On Density-based Local Community Search |
2024 |
PODS |
5 |
5.7494182e-05 |
| 8,025 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
6 |
5.4035905e-05 |
| 8,232 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
4 |
5.3714879e-05 |
| 8,428 |
Truss Decomposition in Hypergraphs |
2025 |
VLDB |
1 |
5.3324907e-05 |
| 8,636 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
5 |
5.2969407e-05 |
| 9,230 |
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor |
2026 |
SIGMOD |
1 |
5.2032182e-05 |
| 9,379 |
Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach |
2024 |
VLDB |
1 |
5.1843659e-05 |
| 9,579 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
3 |
5.154741e-05 |
| 9,736 |
Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs |
2025 |
VLDB |
1 |
5.1325223e-05 |
| 9,872 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
1 |
5.115241e-05 |
| 9,922 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
2 |
5.1079647e-05 |
| 9,955 |
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs |
2025 |
SIGMOD |
3 |
5.1014161e-05 |
| 10,262 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
1 |
5.0480912e-05 |
| 10,334 |
Parallel Colorful h-star Core Maintenance in Dynamic Graphs |
2023 |
VLDB |
2 |
5.0309635e-05 |
| 10,548 |
The Power of Core Clique Removal for Exact Clique Enumeration |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,575 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
1 |
4.9769913e-05 |
| 10,579 |
Fast Optimal Group Steiner Tree Search using GPUs |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,610 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,752 |
Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 10,839 |
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 10,869 |
Maximum Defective Biclique Search in Large Bipartite Graphs |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,121 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
1 |
4.9769913e-05 |
| 11,234 |
OpenFGL: A Comprehensive Benchmark for Federated Graph Learning |
2025 |
VLDB |
0 |
4.9769913e-05 |
| 11,524 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
2 |
4.9769913e-05 |
| 11,546 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
2 |
4.9769913e-05 |
| 11,620 |
FedGTA: Topology-aware Averaging for Federated Graph Learning |
2024 |
VLDB |
2 |
4.9769913e-05 |
| 11,781 |
Approximating Probabilistic Group Steiner Trees in Graphs |
2023 |
VLDB |
1 |
4.9769913e-05 |
| 13,678 |
LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning |
2024 |
VLDB |
1 |
- |