| 428 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00018725237 |
| 615 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00015854124 |
| 844 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00013704523 |
| 958 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.0001303339 |
| 1,352 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.0001116702 |
| 1,681 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
0.00010108085 |
| 2,059 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
9.3142927e-05 |
| 2,094 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.2515997e-05 |
| 2,110 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
9.2155507e-05 |
| 2,438 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.644621e-05 |
| 2,689 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
8.317052e-05 |
| 2,971 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.95959e-05 |
| 3,263 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
7.6516708e-05 |
| 3,445 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.4776468e-05 |
| 3,547 |
Similarity Query Processing for High-Dimensional Data |
2020 |
VLDB |
7.3840679e-05 |
| 3,749 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
7.2091565e-05 |
| 3,750 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
7.2079059e-05 |
| 3,962 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
7.0625443e-05 |
| 4,266 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6.8607427e-05 |
| 4,338 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.8270435e-05 |
| 4,421 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
6.7748547e-05 |
| 4,476 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.7382569e-05 |
| 4,663 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
6.6380734e-05 |
| 4,983 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
6.4819742e-05 |
| 5,139 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
6.4143412e-05 |
| 5,798 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
6.1439835e-05 |
| 5,952 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
6.0909845e-05 |
| 6,280 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.9921635e-05 |
| 6,504 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
5.9147772e-05 |
| 6,537 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
5.9058588e-05 |
| 7,104 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
5.754502e-05 |
| 7,312 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5.703982e-05 |
| 7,318 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5.7027176e-05 |
| 7,460 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.6746526e-05 |
| 7,790 |
Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach |
2024 |
VLDB |
5.6035684e-05 |
| 7,977 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
5.5692809e-05 |
| 8,011 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
5.5653705e-05 |
| 8,133 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
5.5419908e-05 |
| 8,644 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
5.4598872e-05 |
| 8,701 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
5.4455191e-05 |
| 8,929 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5.4076395e-05 |
| 9,228 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
5.3600341e-05 |
| 9,406 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
5.3341661e-05 |
| 9,547 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
5.316206e-05 |
| 9,781 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
5.2719963e-05 |
| 9,951 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
5.226858e-05 |
| 10,120 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,123 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,157 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,334 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
5.1725247e-05 |