| 431 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00018577017 |
| 580 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00016157635 |
| 780 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00014091815 |
| 927 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00013161079 |
| 1,211 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011648789 |
| 1,613 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
0.00010216983 |
| 2,065 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.2352771e-05 |
| 2,097 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
9.1725037e-05 |
| 2,152 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
9.0778596e-05 |
| 2,482 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.5183361e-05 |
| 2,731 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
8.1959181e-05 |
| 3,040 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.8262287e-05 |
| 3,310 |
Similarity Query Processing for High-Dimensional Data |
2020 |
VLDB |
7.5363562e-05 |
| 3,311 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
7.5353184e-05 |
| 3,312 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.5309892e-05 |
| 3,613 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
7.2572837e-05 |
| 3,821 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
7.0933895e-05 |
| 4,008 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.9619668e-05 |
| 4,331 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6.7561061e-05 |
| 4,403 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.7229209e-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,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,208 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
6.3165129e-05 |
| 5,678 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
6.1246854e-05 |
| 5,877 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
6.0551011e-05 |
| 5,987 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
6.0183678e-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,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,226 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
5.6667372e-05 |
| 7,433 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5.6197531e-05 |
| 7,664 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.5720259e-05 |
| 7,908 |
Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach |
2024 |
VLDB |
5.5181056e-05 |
| 8,268 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
5.4574671e-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,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 |
| 9,688 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
5.2351259e-05 |
| 9,942 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
5.1915905e-05 |
| 10,101 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
5.1488731e-05 |
| 10,408 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
5.093636e-05 |
| 10,411 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
5.093636e-05 |
| 10,446 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
5.093636e-05 |
| 10,620 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
5.093636e-05 |