| 283 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00029041257 |
| 891 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015564292 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,257 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.00013020648 |
| 1,445 |
Diversifying Top-K Results |
2012 |
VLDB |
0.00011945231 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011714263 |
| 1,564 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
0.00011350495 |
| 2,162 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.3964337e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,436 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.8252104e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 2,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 2,801 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.0992955e-05 |
| 3,001 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
7.7404487e-05 |
| 3,129 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.5008242e-05 |
| 3,490 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.0465856e-05 |
| 3,603 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
6.9306814e-05 |
| 3,854 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6988744e-05 |
| 4,139 |
On Querying Historical K-Cores |
2021 |
VLDB |
6.415046e-05 |
| 4,208 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
6.357214e-05 |
| 4,394 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.224902e-05 |
| 4,534 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.1049756e-05 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 4,728 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
5.968586e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7470184e-05 |
| 5,540 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4498271e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 5,683 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5.3723969e-05 |
| 5,751 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
5.3409543e-05 |
| 6,207 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1572428e-05 |
| 6,421 |
NUITS: A Novel User Interface for Efficient Keyword Search over Databases |
2006 |
VLDB |
5.0687368e-05 |
| 6,503 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.0357715e-05 |
| 6,588 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.0020648e-05 |
| 6,657 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
4.9720132e-05 |
| 6,795 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9242446e-05 |
| 7,268 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
4.7817823e-05 |
| 7,346 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7556749e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 7,762 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4.6583829e-05 |
| 8,256 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.5490743e-05 |
| 8,505 |
Top-K Nearest Keyword Search on Large Graphs |
2013 |
VLDB |
4.4958064e-05 |
| 8,903 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
4.427232e-05 |
| 9,239 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
4.3690661e-05 |
| 9,626 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
4.314762e-05 |
| 9,952 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
4.2405999e-05 |
| 10,120 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,373 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,383 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,490 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,985 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
4.1945683e-05 |