| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011705344 |
| 1,703 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
0.00010820803 |
| 1,896 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
0.00010173473 |
| 2,291 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0894835e-05 |
| 2,402 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.87387e-05 |
| 2,908 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.92992e-05 |
| 2,988 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
7.7752463e-05 |
| 3,274 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
7.2886717e-05 |
| 3,323 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
7.2170169e-05 |
| 3,857 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6924202e-05 |
| 3,864 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
6.6813849e-05 |
| 4,133 |
On Querying Historical K-Cores |
2021 |
VLDB |
6.4185206e-05 |
| 4,147 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4060893e-05 |
| 4,341 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.268429e-05 |
| 4,391 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.2190075e-05 |
| 4,460 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1592411e-05 |
| 4,536 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.099154e-05 |
| 4,554 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0839934e-05 |
| 4,611 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
6.0438331e-05 |
| 4,727 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
5.9628488e-05 |
| 4,737 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9529218e-05 |
| 5,002 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.7610359e-05 |
| 5,548 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4445937e-05 |
| 5,656 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
5.3876479e-05 |
| 5,764 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
5.3358197e-05 |
| 6,259 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
5.1305787e-05 |
| 6,262 |
Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games |
2024 |
SIGMOD |
5.1300221e-05 |
| 6,588 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
4.9972607e-05 |
| 6,601 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
4.9924633e-05 |
| 6,660 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
4.9672425e-05 |
| 6,796 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9195203e-05 |
| 7,343 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7511136e-05 |
| 7,483 |
Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach |
2024 |
VLDB |
4.7135369e-05 |
| 7,581 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
4.701915e-05 |
| 7,644 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
4.6853638e-05 |
| 7,664 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
4.6805647e-05 |
| 7,674 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
4.677258e-05 |
| 7,714 |
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs |
2024 |
VLDB |
4.6651585e-05 |
| 7,761 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4.6543114e-05 |
| 7,952 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
4.6089395e-05 |
| 8,141 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
4.5724134e-05 |
| 8,526 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
4.4893996e-05 |
| 8,554 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
4.4893996e-05 |
| 8,636 |
WISK: A Workload-aware Learned Index for Spatial Keyword Queries |
2023 |
SIGMOD |
4.4758336e-05 |
| 8,821 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
4.437516e-05 |
| 8,904 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
4.4229886e-05 |
| 9,146 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
4.380727e-05 |
| 9,308 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
4.3544778e-05 |
| 9,411 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
4.3399748e-05 |