| 184 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
98 |
0.00026097449 |
| 659 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
74 |
0.00015048943 |
| 766 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
29 |
0.00014111575 |
| 1,007 |
Influential Community Search in Large Networks |
2015 |
VLDB |
31 |
0.00012550629 |
| 1,224 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
32 |
0.00011458287 |
| 1,476 |
Diversifying Top-K Results |
2012 |
VLDB |
19 |
0.00010546498 |
| 1,501 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
15 |
0.00010456517 |
| 1,572 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
38 |
0.0001019315 |
| 1,645 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
34 |
9.9906562e-05 |
| 2,022 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
32 |
9.1686153e-05 |
| 2,143 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
19 |
8.9625587e-05 |
| 2,190 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
23 |
8.8832666e-05 |
| 2,540 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
13 |
8.3235433e-05 |
| 2,635 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
19 |
8.1954989e-05 |
| 2,923 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
14 |
7.8482459e-05 |
| 3,068 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
9 |
7.6841028e-05 |
| 3,251 |
On Querying Historical K-Cores |
2021 |
VLDB |
22 |
7.4903737e-05 |
| 3,318 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
13 |
7.4289128e-05 |
| 3,329 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
22 |
7.4158814e-05 |
| 3,376 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
14 |
7.3556068e-05 |
| 3,881 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
28 |
6.9477894e-05 |
| 4,095 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
13 |
6.8091843e-05 |
| 4,491 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
15 |
6.5750647e-05 |
| 4,580 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
11 |
6.5195194e-05 |
| 4,637 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
14 |
6.4902365e-05 |
| 5,004 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
13 |
6.3172422e-05 |
| 5,280 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
5 |
6.1970455e-05 |
| 5,343 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
7 |
6.1718642e-05 |
| 5,534 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5 |
6.0906268e-05 |
| 5,664 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
19 |
6.0444315e-05 |
| 5,784 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6 |
5.9944071e-05 |
| 5,804 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
5 |
5.9865208e-05 |
| 6,087 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
13 |
5.8890302e-05 |
| 6,180 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
13 |
5.8570846e-05 |
| 6,205 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
8 |
5.8483206e-05 |
| 6,214 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
11 |
5.8459668e-05 |
| 6,468 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5 |
5.7724639e-05 |
| 7,042 |
NUITS: A Novel User Interface for Efficient Keyword Search over Databases |
2006 |
VLDB |
2 |
5.6117218e-05 |
| 7,379 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
6 |
5.5369684e-05 |
| 7,756 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4 |
5.4570169e-05 |
| 8,503 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5 |
5.3276429e-05 |
| 8,668 |
Top-K Nearest Keyword Search on Large Graphs |
2013 |
VLDB |
2 |
5.2905639e-05 |
| 9,579 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
3 |
5.154741e-05 |
| 9,872 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
1 |
5.115241e-05 |
| 9,943 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
2 |
5.1050756e-05 |
| 10,262 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
1 |
5.0480912e-05 |
| 10,335 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
3 |
5.0309635e-05 |
| 10,611 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 11,121 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
1 |
4.9769913e-05 |
| 11,546 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
2 |
4.9769913e-05 |
| 11,601 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
3 |
4.9769913e-05 |
| 11,606 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
0 |
4.9769913e-05 |
| 11,671 |
Expanding Reverse Nearest Neighbors |
2024 |
VLDB |
0 |
4.9769913e-05 |
| 12,456 |
Leveraging Graph Dimensions in Online Graph Search |
2015 |
VLDB |
0 |
4.9769913e-05 |
| 12,536 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
3 |
4.9769913e-05 |
| 12,758 |
Ten Thousand SQLs: Parallel Keyword Queries Computing |
2010 |
VLDB |
0 |
4.9769913e-05 |