| 5,751 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
5.3409543e-05 |
| 5,820 |
Efficient Processing of XML Path Queries Using the Disk-based F&B Index |
2005 |
VLDB |
5.3135144e-05 |
| 6,207 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1572428e-05 |
| 6,259 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
5.1355079e-05 |
| 6,281 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.128862e-05 |
| 6,503 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.0357715e-05 |
| 6,588 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.0020648e-05 |
| 6,600 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
4.9972581e-05 |
| 6,631 |
Demand-Aware Route Planning for Shared Mobility Services |
2020 |
VLDB |
4.9856578e-05 |
| 6,657 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
4.9720132e-05 |
| 6,795 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9242446e-05 |
| 7,346 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7556749e-05 |
| 7,561 |
Efficient Recovery of Missing Events |
2013 |
VLDB |
4.7102455e-05 |
| 7,576 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
4.7064285e-05 |
| 7,645 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
4.6896215e-05 |
| 7,762 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4.6583829e-05 |
| 7,949 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
4.613363e-05 |
| 8,209 |
VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search |
2025 |
VLDB |
4.5581054e-05 |
| 8,234 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
4.5535352e-05 |
| 8,527 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
4.4937074e-05 |
| 8,557 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
4.4937074e-05 |
| 8,668 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
4.4718257e-05 |
| 8,821 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
4.4417735e-05 |
| 8,903 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
4.427232e-05 |
| 9,146 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
4.3849295e-05 |
| 9,150 |
Infinite Stream Estimation under Personalized w-Event Privacy |
2025 |
VLDB |
4.3849295e-05 |
| 9,308 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
4.3571035e-05 |
| 9,309 |
Reverse k Nearest Neighbors Query Processing: Experiments and Analysis |
2015 |
VLDB |
4.3571035e-05 |
| 9,405 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
4.3441378e-05 |
| 9,477 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
4.3341665e-05 |
| 9,483 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
4.3341665e-05 |
| 9,553 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
4.3254416e-05 |
| 9,595 |
High-Ratio Compression for Machine-Generated Data |
2023 |
SIGMOD |
4.3194469e-05 |
| 9,663 |
Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets |
2003 |
VLDB |
4.3089103e-05 |
| 9,730 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
4.2942813e-05 |
| 9,952 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
4.2405999e-05 |
| 10,088 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,123 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,157 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,166 |
FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,232 |
Efficient Temporal Subgraph Management: A New Interval Index |
2026 |
VLDB |
4.1945683e-05 |
| 10,322 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
4.1945683e-05 |
| 10,383 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,530 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
4.1945683e-05 |
| 10,632 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 10,675 |
On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing |
2025 |
VLDB |
4.1945683e-05 |
| 10,700 |
LogLite: Lightweight Plug-and-Play Streaming Log Compression |
2025 |
VLDB |
4.1945683e-05 |
| 10,871 |
Efficient Computation of Hyper-triangles on Hypergraphs |
2025 |
VLDB |
4.1945683e-05 |
| 10,964 |
Graph Summarization: Compactness Meets Efficiency |
2024 |
SIGMOD |
4.1945683e-05 |
| 10,985 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
4.1945683e-05 |