| 184 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00026100147 |
| 657 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.0001505607 |
| 766 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00014118259 |
| 1,007 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.00012556573 |
| 1,222 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011463714 |
| 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,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,634 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
8.1993804e-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,249 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.4939212e-05 |
| 3,318 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
7.4324312e-05 |
| 3,328 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.4193937e-05 |
| 3,376 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
7.3590905e-05 |
| 3,880 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.9510799e-05 |
| 4,091 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.8124092e-05 |
| 4,488 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.5781787e-05 |
| 4,578 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
6.5226071e-05 |
| 4,634 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.4933103e-05 |
| 5,000 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
6.3202341e-05 |
| 5,277 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
6.1999805e-05 |
| 5,336 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
6.1747873e-05 |
| 5,531 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
6.0935114e-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,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 |
| 7,041 |
NUITS: A Novel User Interface for Efficient Keyword Search over Databases |
2006 |
VLDB |
5.6143673e-05 |
| 7,377 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
5.5395908e-05 |
| 7,752 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.4595236e-05 |
| 8,496 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5.3301662e-05 |
| 8,662 |
Top-K Nearest Keyword Search on Large Graphs |
2013 |
VLDB |
5.2928638e-05 |
| 9,571 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
5.1571823e-05 |
| 9,865 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
5.1176637e-05 |
| 9,936 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
5.1074935e-05 |
| 10,256 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
5.050482e-05 |
| 10,328 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
5.0333462e-05 |
| 10,600 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
4.9793485e-05 |
| 11,112 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
4.9793485e-05 |
| 11,540 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
4.9793485e-05 |