| 182 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
101 |
0.00026383593 |
| 658 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
75 |
0.00015032442 |
| 771 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
29 |
0.00014081924 |
| 970 |
Influential Community Search in Large Networks |
2015 |
VLDB |
33 |
0.00012749284 |
| 1,227 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
32 |
0.00011426039 |
| 1,478 |
Diversifying Top-K Results |
2012 |
VLDB |
19 |
0.00010511781 |
| 1,505 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
15 |
0.00010424285 |
| 1,565 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
38 |
0.00010185615 |
| 1,581 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
35 |
0.00010151896 |
| 2,023 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
33 |
9.1568397e-05 |
| 2,150 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
19 |
8.9509559e-05 |
| 2,201 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
23 |
8.8626226e-05 |
| 2,470 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
14 |
8.4015437e-05 |
| 2,635 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
20 |
8.1795762e-05 |
| 2,933 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
14 |
7.827041e-05 |
| 3,071 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
9 |
7.6670408e-05 |
| 3,145 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
24 |
7.5828479e-05 |
| 3,170 |
On Querying Historical K-Cores |
2021 |
VLDB |
23 |
7.5572564e-05 |
| 3,221 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
14 |
7.5060153e-05 |
| 3,387 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
14 |
7.3346183e-05 |
| 3,863 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
14 |
6.9488207e-05 |
| 3,885 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
28 |
6.9282318e-05 |
| 4,214 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
16 |
6.7186746e-05 |
| 4,567 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
22 |
6.5173666e-05 |
| 4,597 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
11 |
6.4979622e-05 |
| 4,658 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
14 |
6.468776e-05 |
| 5,026 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
13 |
6.2965202e-05 |
| 5,298 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
5 |
6.1768321e-05 |
| 5,357 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
7 |
6.1514562e-05 |
| 5,409 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
6 |
6.1320768e-05 |
| 5,557 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5 |
6.0704874e-05 |
| 5,790 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6 |
5.9762012e-05 |
| 6,073 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
13 |
5.8780393e-05 |
| 6,192 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
13 |
5.8377174e-05 |
| 6,209 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
8 |
5.8323161e-05 |
| 6,226 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
11 |
5.8266364e-05 |
| 6,465 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5 |
5.7596353e-05 |
| 7,063 |
NUITS: A Novel User Interface for Efficient Keyword Search over Databases |
2006 |
VLDB |
2 |
5.5932475e-05 |
| 7,399 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
6 |
5.5186598e-05 |
| 7,769 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4 |
5.4391973e-05 |
| 8,519 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
6 |
5.3100264e-05 |
| 8,684 |
Top-K Nearest Keyword Search on Large Graphs |
2013 |
VLDB |
2 |
5.2733276e-05 |
| 9,604 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
4 |
5.1376962e-05 |
| 9,906 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
2 |
5.0983269e-05 |
| 9,976 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
2 |
5.0881951e-05 |
| 10,291 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
2 |
5.031399e-05 |
| 10,361 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
3 |
5.014328e-05 |
| 10,672 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
1 |
4.9605343e-05 |
| 11,182 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
1 |
4.9605343e-05 |
| 11,595 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
2 |
4.9605343e-05 |
| 11,648 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
4 |
4.9605343e-05 |
| 11,653 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
0 |
4.9605343e-05 |
| 11,717 |
Expanding Reverse Nearest Neighbors |
2024 |
VLDB |
0 |
4.9605343e-05 |
| 12,499 |
Leveraging Graph Dimensions in Online Graph Search |
2015 |
VLDB |
0 |
4.9605343e-05 |
| 12,579 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
3 |
4.9605343e-05 |
| 12,801 |
Ten Thousand SQLs: Parallel Keyword Queries Computing |
2010 |
VLDB |
0 |
4.9605343e-05 |