| 657 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.0001505607 |
| 1,222 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011463714 |
| 1,396 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
0.0001079253 |
| 1,626 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
0.00010043754 |
| 1,663 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.9441685e-05 |
| 2,325 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
8.6310032e-05 |
| 2,634 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
8.1993804e-05 |
| 2,702 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.1177147e-05 |
| 2,869 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
7.9235321e-05 |
| 3,249 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.4939212e-05 |
| 3,328 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.4193937e-05 |
| 3,412 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
7.3251247e-05 |
| 3,569 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
7.1987748e-05 |
| 3,789 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
7.0191274e-05 |
| 3,875 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
6.9536357e-05 |
| 3,880 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.9510799e-05 |
| 4,044 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.8334494e-05 |
| 4,091 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.8124092e-05 |
| 4,123 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
6.7927568e-05 |
| 4,422 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6.6060521e-05 |
| 4,578 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
6.5226071e-05 |
| 4,634 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.4933103e-05 |
| 4,745 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
6.4385742e-05 |
| 5,000 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
6.3202341e-05 |
| 5,264 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
6.2038361e-05 |
| 5,428 |
Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games |
2024 |
SIGMOD |
6.1339984e-05 |
| 5,781 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
5.9972461e-05 |
| 5,998 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
5.9198696e-05 |
| 6,177 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
5.8598586e-05 |
| 6,200 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
5.8510904e-05 |
| 6,211 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
5.8487355e-05 |
| 6,466 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.7751978e-05 |
| 6,495 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
5.7658592e-05 |
| 6,775 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
5.685295e-05 |
| 7,076 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5.6061365e-05 |
| 7,248 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
5.5746656e-05 |
| 7,561 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5.4958573e-05 |
| 7,634 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
5.4792319e-05 |
| 7,724 |
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs |
2024 |
VLDB |
5.4672516e-05 |
| 7,752 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.4595236e-05 |
| 7,941 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
5.4219572e-05 |
| 8,077 |
Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach |
2024 |
VLDB |
5.3942942e-05 |
| 8,196 |
WISK: A Workload-aware Learned Index for Spatial Keyword Queries |
2023 |
SIGMOD |
5.3794981e-05 |
| 8,420 |
On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing |
2025 |
VLDB |
5.3350162e-05 |
| 8,434 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
5.3350162e-05 |
| 8,496 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5.3301662e-05 |
| 8,895 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
5.2559789e-05 |
| 8,990 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
5.2421474e-05 |
| 9,073 |
Machine Learning for Graph Data Management and Query Processing |
2025 |
VLDB |
5.2283159e-05 |
| 9,309 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
5.1969334e-05 |