| 5,264 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
6.2038361e-05 |
| 5,662 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
6.0472942e-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,070 |
Efficient Processing of XML Path Queries Using the Disk-based F&B Index |
2005 |
VLDB |
5.896379e-05 |
| 6,107 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.8852347e-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,430 |
Demand-Aware Route Planning for Shared Mobility Services |
2020 |
VLDB |
5.5298431e-05 |
| 7,561 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5.4958573e-05 |
| 7,700 |
VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search |
2025 |
VLDB |
5.4750332e-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,169 |
Efficient Recovery of Missing Events |
2013 |
VLDB |
5.3847972e-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,487 |
Reverse k Nearest Neighbors Query Processing: Experiments and Analysis |
2015 |
VLDB |
5.3322198e-05 |
| 8,496 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5.3301662e-05 |
| 8,788 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
5.2767294e-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,309 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
5.1969334e-05 |
| 9,474 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
5.1708619e-05 |
| 9,481 |
Infinite Stream Estimation under Personalized w-Event Privacy |
2025 |
VLDB |
5.1708619e-05 |
| 9,525 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
5.1662415e-05 |
| 9,735 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
5.1349531e-05 |
| 9,805 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
5.1257999e-05 |
| 9,843 |
High-Ratio Compression for Machine-Generated Data |
2023 |
SIGMOD |
5.1223012e-05 |
| 9,864 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
5.1176637e-05 |
| 9,992 |
Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets |
2003 |
VLDB |
5.099523e-05 |
| 10,062 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
5.0875952e-05 |
| 10,328 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
5.0333462e-05 |
| 10,479 |
Maintaining Biconnected Components in Streaming Graphs |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,485 |
Nucleus Decomposition Revisited: An Efficient Counting-Based Approach |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,576 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,603 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,634 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,642 |
FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,705 |
Efficient Temporal Subgraph Management: A New Interval Index |
2026 |
VLDB |
4.9793485e-05 |
| 10,806 |
Efficient Hyper-truss Decomposition over Hypergraphs |
2026 |
VLDB |
4.9793485e-05 |
| 11,066 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
4.9793485e-05 |
| 11,112 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
4.9793485e-05 |
| 11,215 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
4.9793485e-05 |
| 11,286 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
4.9793485e-05 |
| 11,334 |
LogLite: Lightweight Plug-and-Play Streaming Log Compression |
2025 |
VLDB |
4.9793485e-05 |