| 659 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00015214062 |
| 1,211 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011648789 |
| 1,363 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
0.00011025316 |
| 1,588 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
0.0001026895 |
| 1,647 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
0.00010125633 |
| 2,294 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
8.7939844e-05 |
| 2,650 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.2920414e-05 |
| 2,731 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
8.1959181e-05 |
| 2,826 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
8.0865974e-05 |
| 3,261 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.5853837e-05 |
| 3,312 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.5309892e-05 |
| 3,522 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
7.3491042e-05 |
| 3,613 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
7.2572837e-05 |
| 3,737 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
7.1609645e-05 |
| 3,821 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
7.0933895e-05 |
| 3,997 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.9679551e-05 |
| 4,008 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.9619668e-05 |
| 4,158 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
6.8628196e-05 |
| 4,331 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6.7561061e-05 |
| 4,485 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
6.6715036e-05 |
| 4,551 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.6355948e-05 |
| 4,579 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
6.6203846e-05 |
| 4,650 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
6.5863543e-05 |
| 5,044 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
6.3883109e-05 |
| 5,149 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
6.3459884e-05 |
| 5,441 |
Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games |
2024 |
SIGMOD |
6.2184806e-05 |
| 5,797 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6.0859157e-05 |
| 5,877 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
6.0551011e-05 |
| 6,075 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
5.9853864e-05 |
| 6,342 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.9068493e-05 |
| 6,367 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
5.8981989e-05 |
| 6,535 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
5.8486743e-05 |
| 6,603 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
5.824568e-05 |
| 6,642 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
5.8157857e-05 |
| 6,937 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5.7348103e-05 |
| 7,418 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
5.6236086e-05 |
| 7,433 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5.6197531e-05 |
| 7,578 |
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs |
2024 |
VLDB |
5.5927377e-05 |
| 7,664 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.5720259e-05 |
| 7,764 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
5.5499989e-05 |
| 7,908 |
Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach |
2024 |
VLDB |
5.5181056e-05 |
| 8,048 |
WISK: A Workload-aware Learned Index for Spatial Keyword Queries |
2023 |
SIGMOD |
5.5003171e-05 |
| 8,268 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
5.4574671e-05 |
| 8,731 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
5.3766157e-05 |
| 8,760 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
5.3766157e-05 |
| 8,821 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
5.3624668e-05 |
| 9,057 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5.3251649e-05 |
| 9,301 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
5.289545e-05 |
| 9,355 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
5.282937e-05 |
| 9,557 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
5.2528121e-05 |