| 970 |
Influential Community Search in Large Networks |
2015 |
VLDB |
33 |
0.00012749284 |
| 3,221 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
14 |
7.5060153e-05 |
| 3,387 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
14 |
7.3346183e-05 |
| 4,155 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
10 |
6.7613076e-05 |
| 4,244 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
7 |
6.6963298e-05 |
| 4,753 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
8 |
6.4218566e-05 |
| 5,298 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
5 |
6.1768321e-05 |
| 5,357 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
7 |
6.1514562e-05 |
| 5,500 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
8 |
6.0910824e-05 |
| 5,557 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5 |
6.0704874e-05 |
| 5,569 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
7 |
6.0630474e-05 |
| 5,771 |
QTCS: Efficient Query-Centered Temporal Community Search |
2024 |
VLDB |
9 |
5.9830136e-05 |
| 6,047 |
Efficient Estimation of Heat Kernel PageRank for Local Clustering |
2019 |
SIGMOD |
11 |
5.8870311e-05 |
| 6,208 |
On Density-based Local Community Search |
2024 |
PODS |
6 |
5.8325357e-05 |
| 6,416 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
10 |
5.7744984e-05 |
| 8,008 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
7 |
5.3916283e-05 |
| 8,251 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
5 |
5.3537264e-05 |
| 8,444 |
Truss Decomposition in Hypergraphs |
2025 |
VLDB |
1 |
5.3148581e-05 |
| 8,655 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
6 |
5.2794257e-05 |
| 9,254 |
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor |
2026 |
SIGMOD |
1 |
5.1860131e-05 |
| 9,405 |
Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach |
2024 |
VLDB |
1 |
5.1672232e-05 |
| 9,604 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
4 |
5.1376962e-05 |
| 9,768 |
Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs |
2025 |
VLDB |
1 |
5.115551e-05 |
| 9,906 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
2 |
5.0983269e-05 |
| 9,957 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
3 |
5.0910746e-05 |
| 9,988 |
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs |
2025 |
SIGMOD |
4 |
5.0845476e-05 |
| 10,291 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
2 |
5.031399e-05 |
| 10,360 |
Parallel Colorful h-star Core Maintenance in Dynamic Graphs |
2023 |
VLDB |
2 |
5.014328e-05 |
| 10,407 |
Scaling Up Density Decomposition on Massive Graphs |
2027 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,414 |
Tree+DAG: An Efficient Index for Resistance Distance Computation on Core-Periphery Graphs |
2027 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,613 |
The Power of Core Clique Removal for Exact Clique Enumeration |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,638 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
2 |
4.9605343e-05 |
| 10,642 |
Fast Optimal Group Steiner Tree Search using GPUs |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,671 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,813 |
Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 10,900 |
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 10,930 |
Maximum Defective Biclique Search in Large Bipartite Graphs |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,182 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
1 |
4.9605343e-05 |
| 11,290 |
OpenFGL: A Comprehensive Benchmark for Federated Graph Learning |
2025 |
VLDB |
0 |
4.9605343e-05 |
| 11,573 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
2 |
4.9605343e-05 |
| 11,595 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
2 |
4.9605343e-05 |
| 11,667 |
FedGTA: Topology-aware Averaging for Federated Graph Learning |
2024 |
VLDB |
2 |
4.9605343e-05 |
| 11,825 |
Approximating Probabilistic Group Steiner Trees in Graphs |
2023 |
VLDB |
1 |
4.9605343e-05 |
| 13,718 |
LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning |
2024 |
VLDB |
1 |
- |