| 1,256 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.00013009097 |
| 3,608 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
6.9241653e-05 |
| 4,209 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
6.3511029e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0340995e-05 |
| 5,021 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
5.7481039e-05 |
| 5,606 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4126223e-05 |
| 5,697 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5.3672389e-05 |
| 5,713 |
Efficient Estimation of Heat Kernel PageRank for Local Clustering |
2019 |
SIGMOD |
5.3595796e-05 |
| 5,909 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
5.2722596e-05 |
| 6,530 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
5.0197442e-05 |
| 6,811 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
4.9139947e-05 |
| 7,081 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
4.833459e-05 |
| 7,267 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
4.7771943e-05 |
| 7,446 |
QTCS: Efficient Query-Centered Temporal Community Search |
2024 |
VLDB |
4.7232788e-05 |
| 7,934 |
On Density-based Local Community Search |
2024 |
PODS |
4.6089395e-05 |
| 9,246 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
4.3648789e-05 |
| 9,252 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
4.3648789e-05 |
| 9,330 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
4.351469e-05 |
| 9,641 |
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs |
2025 |
SIGMOD |
4.3067693e-05 |
| 9,950 |
Parallel Colorful h-star Core Maintenance in Dynamic Graphs |
2023 |
VLDB |
4.236537e-05 |
| 10,028 |
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,033 |
Scaling Up k-Clique Percolation Community Detection |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,037 |
The Power of Core Clique Removal for Exact Clique Enumeration |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,075 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,079 |
Fast Optimal Group Steiner Tree Search using GPUs |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,272 |
Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs |
2026 |
VLDB |
4.1905499e-05 |
| 10,385 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,395 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,500 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,554 |
OpenFGL: A Comprehensive Benchmark for Federated Graph Learning |
2025 |
VLDB |
4.1905499e-05 |
| 10,604 |
Truss Decomposition in Hypergraphs |
2025 |
VLDB |
4.1905499e-05 |
| 10,869 |
Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs |
2025 |
VLDB |
4.1905499e-05 |
| 10,960 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
4.1905499e-05 |
| 10,962 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.1905499e-05 |
| 10,988 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
4.1905499e-05 |
| 11,051 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 11,089 |
FedGTA: Topology-aware Averaging for Federated Graph Learning |
2024 |
VLDB |
4.1905499e-05 |
| 11,266 |
Approximating Probabilistic Group Steiner Trees in Graphs |
2023 |
VLDB |
4.1905499e-05 |
| 13,166 |
LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning |
2024 |
VLDB |
- |
| 13,188 |
Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach |
2024 |
VLDB |
- |