| 657 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.0001505607 |
| 1,476 |
Diversifying Top-K Results |
2012 |
VLDB |
0.00010551487 |
| 1,501 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
0.00010461358 |
| 1,572 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
0.00010197978 |
| 1,626 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
0.00010043754 |
| 1,645 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.9953879e-05 |
| 2,020 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.1729558e-05 |
| 2,141 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.9668034e-05 |
| 2,188 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.8874739e-05 |
| 2,540 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.3274854e-05 |
| 2,921 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.8519256e-05 |
| 3,066 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.6877117e-05 |
| 3,189 |
Efficient Maximum k-Plex Computation over Large Sparse Graphs |
2023 |
VLDB |
7.5528776e-05 |
| 3,328 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.4193937e-05 |
| 3,444 |
Efficient Size-Bounded Community Search over Large Networks |
2021 |
VLDB |
7.2966268e-05 |
| 3,860 |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity |
2023 |
SIGMOD |
6.9663663e-05 |
| 4,358 |
Anchored Densest Subgraph |
2022 |
SIGMOD |
6.6402693e-05 |
| 4,488 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.5781787e-05 |
| 5,264 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
6.2038361e-05 |
| 5,585 |
Maximum k-Plex Computation: Theory and Practice |
2024 |
SIGMOD |
6.0761018e-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,803 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
5.9893561e-05 |
| 6,107 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.8852347e-05 |
| 6,211 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
5.8487355e-05 |
| 6,914 |
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance |
2025 |
VLDB |
5.6465623e-05 |
| 7,634 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
5.4792319e-05 |
| 7,752 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.4595236e-05 |
| 7,775 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
5.4548071e-05 |
| 7,894 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
5.4320165e-05 |
| 8,772 |
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition |
2022 |
VLDB |
5.2806308e-05 |
| 9,116 |
Automatic Index Selection for Large-Scale Datalog Computation |
2019 |
VLDB |
5.2270261e-05 |
| 10,328 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
5.0333462e-05 |
| 10,567 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,647 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,749 |
FB*: A Compact Index for Efficient and Exact Density-based Clustering |
2026 |
VLDB |
4.9793485e-05 |
| 11,099 |
A Local Search Approach to Efficient (k, p)-Core Maintenance |
2025 |
SIGMOD |
4.9793485e-05 |
| 11,187 |
Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods |
2025 |
SIGMOD |
4.9793485e-05 |
| 12,530 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
4.9793485e-05 |
| 12,752 |
Ten Thousand SQLs: Parallel Keyword Queries Computing |
2010 |
VLDB |
4.9793485e-05 |