| 189 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00026114928 |
| 659 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00015214062 |
| 780 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00014091815 |
| 982 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.0001283311 |
| 1,211 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011648789 |
| 1,454 |
Diversifying Top-K Results |
2012 |
VLDB |
0.00010739504 |
| 1,552 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
0.00010379532 |
| 1,555 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
0.00010370683 |
| 1,613 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
0.00010216983 |
| 2,065 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.2352771e-05 |
| 2,097 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
9.1725037e-05 |
| 2,152 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
9.0778596e-05 |
| 2,482 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.5183361e-05 |
| 2,731 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
8.1959181e-05 |
| 3,008 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.8578871e-05 |
| 3,040 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.8262287e-05 |
| 3,254 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
7.5928992e-05 |
| 3,261 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.5853837e-05 |
| 3,312 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.5309892e-05 |
| 3,337 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
7.5072753e-05 |
| 3,821 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
7.0933895e-05 |
| 4,008 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.9619668e-05 |
| 4,403 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.7229209e-05 |
| 4,485 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
6.6715036e-05 |
| 4,551 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.6355948e-05 |
| 5,044 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
6.3883109e-05 |
| 5,208 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
6.3165129e-05 |
| 5,540 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
6.1809407e-05 |
| 5,678 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
6.1246854e-05 |
| 5,797 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6.0859157e-05 |
| 5,987 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
6.0183678e-05 |
| 6,075 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
5.9853864e-05 |
| 6,342 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.9068493e-05 |
| 6,469 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5.8710857e-05 |
| 6,535 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
5.8486743e-05 |
| 6,603 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
5.824568e-05 |
| 6,909 |
NUITS: A Novel User Interface for Efficient Keyword Search over Databases |
2006 |
VLDB |
5.7414855e-05 |
| 7,094 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
5.7055799e-05 |
| 7,226 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
5.6667372e-05 |
| 7,664 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.5720259e-05 |
| 8,493 |
Top-K Nearest Keyword Search on Large Graphs |
2013 |
VLDB |
5.4142883e-05 |
| 9,057 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5.3251649e-05 |
| 9,387 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
5.2755515e-05 |
| 9,689 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
5.2351259e-05 |
| 9,759 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
5.2247222e-05 |
| 10,101 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
5.1488731e-05 |
| 10,408 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
5.093636e-05 |
| 10,671 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
5.093636e-05 |
| 10,767 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
5.093636e-05 |
| 11,198 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
5.093636e-05 |