| 438 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
71 |
0.00018278591 |
| 562 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
48 |
0.00016350316 |
| 766 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
29 |
0.00014111575 |
| 937 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
57 |
0.00012971451 |
| 1,224 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
32 |
0.00011458287 |
| 1,645 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
34 |
9.9906562e-05 |
| 2,022 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
32 |
9.1686153e-05 |
| 2,143 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
19 |
8.9625587e-05 |
| 2,190 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
23 |
8.8832666e-05 |
| 2,540 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
13 |
8.3235433e-05 |
| 2,635 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
19 |
8.1954989e-05 |
| 2,923 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
14 |
7.8482459e-05 |
| 3,232 |
Similarity Query Processing for High-Dimensional Data |
2020 |
VLDB |
14 |
7.5029541e-05 |
| 3,251 |
On Querying Historical K-Cores |
2021 |
VLDB |
22 |
7.4903737e-05 |
| 3,369 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
9 |
7.3663492e-05 |
| 3,412 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
10 |
7.321657e-05 |
| 3,881 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
28 |
6.9477894e-05 |
| 4,095 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
13 |
6.8091843e-05 |
| 4,424 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6 |
6.6029248e-05 |
| 4,491 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
15 |
6.5750647e-05 |
| 4,580 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
11 |
6.5195194e-05 |
| 4,637 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
14 |
6.4902365e-05 |
| 4,748 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
5 |
6.4355262e-05 |
| 5,004 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
13 |
6.3172422e-05 |
| 5,343 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
7 |
6.1718642e-05 |
| 5,804 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
5 |
5.9865208e-05 |
| 6,000 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
12 |
5.9170672e-05 |
| 6,087 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
13 |
5.8890302e-05 |
| 6,180 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
13 |
5.8570846e-05 |
| 6,468 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5 |
5.7724639e-05 |
| 6,497 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
5 |
5.7631297e-05 |
| 6,780 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
7 |
5.6826037e-05 |
| 7,077 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5 |
5.6034826e-05 |
| 7,379 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
6 |
5.5369684e-05 |
| 7,567 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5 |
5.4933119e-05 |
| 7,756 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4 |
5.4570169e-05 |
| 7,945 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
3 |
5.4193905e-05 |
| 8,084 |
Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach |
2024 |
VLDB |
3 |
5.3917406e-05 |
| 8,429 |
On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing |
2025 |
VLDB |
2 |
5.3324907e-05 |
| 8,443 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
1 |
5.3324907e-05 |
| 8,503 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5 |
5.3276429e-05 |
| 8,999 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
8 |
5.2396658e-05 |
| 9,082 |
Machine Learning for Graph Data Management and Query Processing |
2025 |
VLDB |
1 |
5.2258409e-05 |
| 9,474 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
2 |
5.1703774e-05 |
| 9,740 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
2 |
5.1325223e-05 |
| 9,871 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
3 |
5.115241e-05 |
| 10,131 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
2 |
5.0727027e-05 |
| 10,335 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
3 |
5.0309635e-05 |
| 10,611 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,614 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
1 |
4.9769913e-05 |
| 10,645 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 11,075 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,121 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
1 |
4.9769913e-05 |
| 11,294 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
2 |
4.9769913e-05 |
| 11,452 |
Efficient Computation of Hyper-triangles on Hypergraphs |
2025 |
VLDB |
2 |
4.9769913e-05 |
| 11,529 |
Graph Summarization: Compactness Meets Efficiency |
2024 |
SIGMOD |
1 |
4.9769913e-05 |
| 11,546 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
2 |
4.9769913e-05 |
| 11,552 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
SIGMOD |
2 |
4.9769913e-05 |
| 11,601 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
3 |
4.9769913e-05 |
| 11,606 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
0 |
4.9769913e-05 |