| 202 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00025608916 |
| 682 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00015144404 |
| 844 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00013704523 |
| 976 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.00012949951 |
| 1,352 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.0001116702 |
| 1,435 |
Diversifying Top-K Results |
2012 |
VLDB |
0.00010887716 |
| 1,519 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
0.00010567722 |
| 1,566 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
0.00010397786 |
| 1,681 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
0.00010108085 |
| 2,059 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
9.3142927e-05 |
| 2,094 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.2515997e-05 |
| 2,110 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
9.2155507e-05 |
| 2,438 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.644621e-05 |
| 2,689 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
8.317052e-05 |
| 2,971 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.95959e-05 |
| 2,985 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.9430737e-05 |
| 3,241 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
7.6781346e-05 |
| 3,243 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.6761871e-05 |
| 3,445 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.4776468e-05 |
| 3,645 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
7.3005709e-05 |
| 3,749 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
7.2091565e-05 |
| 3,962 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
7.0625443e-05 |
| 4,338 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.8270435e-05 |
| 4,421 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
6.7748547e-05 |
| 4,476 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.7382569e-05 |
| 4,983 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
6.4819742e-05 |
| 5,139 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
6.4143412e-05 |
| 5,710 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6.1795374e-05 |
| 5,830 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
6.132672e-05 |
| 5,952 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
6.0909845e-05 |
| 6,280 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.9921635e-05 |
| 6,369 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5.9620153e-05 |
| 6,405 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
5.9523652e-05 |
| 6,504 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
5.9147772e-05 |
| 6,740 |
NUITS: A Novel User Interface for Efficient Keyword Search over Databases |
2006 |
VLDB |
5.8440829e-05 |
| 7,029 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
5.7754385e-05 |
| 7,104 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
5.754502e-05 |
| 7,460 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.6746526e-05 |
| 7,584 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
5.6478565e-05 |
| 8,011 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
5.5653705e-05 |
| 8,370 |
Top-K Nearest Keyword Search on Large Graphs |
2013 |
VLDB |
5.4979725e-05 |
| 8,929 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5.4076395e-05 |
| 9,255 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
5.3572577e-05 |
| 9,612 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
5.3056412e-05 |
| 9,951 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
5.226858e-05 |
| 10,120 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,385 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
5.1725247e-05 |
| 10,395 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
5.1725247e-05 |
| 10,500 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
5.1725247e-05 |
| 10,988 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
5.1725247e-05 |