| 284 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00029014359 |
| 888 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015549756 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,256 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.00013009097 |
| 1,435 |
Diversifying Top-K Results |
2012 |
VLDB |
0.00011981694 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011705344 |
| 1,564 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
0.00011340407 |
| 2,172 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.37776e-05 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 2,440 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.8166939e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5600506e-05 |
| 2,643 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3894193e-05 |
| 2,787 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.1219297e-05 |
| 2,988 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
7.7752463e-05 |
| 3,188 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.4142307e-05 |
| 3,461 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.0696567e-05 |
| 3,608 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
6.9241653e-05 |
| 3,857 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6924202e-05 |
| 4,133 |
On Querying Historical K-Cores |
2021 |
VLDB |
6.4185206e-05 |
| 4,209 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
6.3511029e-05 |
| 4,391 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.2190075e-05 |
| 4,536 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.099154e-05 |
| 4,554 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0839934e-05 |
| 4,727 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
5.9628488e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7414979e-05 |
| 5,548 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4445937e-05 |
| 5,606 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4126223e-05 |
| 5,697 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5.3672389e-05 |
| 5,764 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
5.3358197e-05 |
| 6,206 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1522897e-05 |
| 6,413 |
NUITS: A Novel User Interface for Efficient Keyword Search over Databases |
2006 |
VLDB |
5.0649653e-05 |
| 6,497 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.0324877e-05 |
| 6,588 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
4.9972607e-05 |
| 6,660 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
4.9672425e-05 |
| 6,796 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9195203e-05 |
| 7,267 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
4.7771943e-05 |
| 7,343 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7511136e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 7,761 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4.6543114e-05 |
| 8,252 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.544713e-05 |
| 8,504 |
Top-K Nearest Keyword Search on Large Graphs |
2013 |
VLDB |
4.491551e-05 |
| 8,904 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
4.4229886e-05 |
| 9,246 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
4.3648789e-05 |
| 9,626 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
4.3106273e-05 |
| 9,951 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
4.236537e-05 |
| 10,120 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,385 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,395 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,500 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,988 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
4.1905499e-05 |