| 714 |
Effective Community Search for Large Attributed Graphs |
2016 |
VLDB |
0.00014569079 |
| 1,414 |
Effective Community Search over Large Spatial Graphs |
2017 |
VLDB |
0.0001073756 |
| 1,663 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.9441685e-05 |
| 2,042 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
9.1416822e-05 |
| 3,466 |
In-depth Analysis of Graph-based RAG in a Unified Framework |
2025 |
VLDB |
7.2783993e-05 |
| 3,789 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
7.0191274e-05 |
| 3,875 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
6.9536357e-05 |
| 3,921 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
6.9237898e-05 |
| 4,044 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.8334494e-05 |
| 4,776 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
6.4191794e-05 |
| 4,923 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
6.3522796e-05 |
| 4,954 |
Effective Community Search over Large Star-Schema Heterogeneous Information Networks |
2022 |
VLDB |
6.3411444e-05 |
| 5,629 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0592611e-05 |
| 5,647 |
Walking in the Cloud: Parallel SimRank at Scale |
2016 |
VLDB |
6.0524588e-05 |
| 6,651 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5.7203229e-05 |
| 7,058 |
C-Explorer: Browsing Communities in Large Graphs |
2017 |
VLDB |
5.6106438e-05 |
| 7,807 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
5.4495451e-05 |
| 8,178 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
5.382671e-05 |
| 8,196 |
WISK: A Workload-aware Learned Index for Spatial Keyword Queries |
2023 |
SIGMOD |
5.3794981e-05 |
| 8,393 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
5.3410533e-05 |
| 8,645 |
Efficiently Counting Triangles in Large Temporal Graphs |
2025 |
SIGMOD |
5.2954976e-05 |
| 8,974 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
5.2454233e-05 |
| 9,191 |
Interactive Graph Search for Multiple Targets on DAGs |
2025 |
VLDB |
5.2110714e-05 |
| 9,867 |
Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks |
2025 |
VLDB |
5.1176637e-05 |
| 9,944 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
5.1042523e-05 |
| 10,102 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
5.0789354e-05 |
| 10,255 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
5.050482e-05 |
| 10,442 |
Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,466 |
HAMMER: An Automatic RAG Tuning System via Hierarchical Memory-Guided Monte Carlo Tree Search |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,562 |
Efficient and Scalable Directed Densest Subgraph Discovery |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,636 |
Efficient Influential Community Search over Dynamic Graphs |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,665 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,708 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
4.9793485e-05 |
| 10,712 |
Effective Durable Community Search in Large Temporal Graph |
2026 |
VLDB |
4.9793485e-05 |
| 10,791 |
BookRAG: A Hierarchical Structure-aware Index-based Approach for Retrieval-Augmented Generation on Complex Documents |
2026 |
VLDB |
4.9793485e-05 |
| 10,808 |
Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer |
2026 |
VLDB |
4.9793485e-05 |
| 11,029 |
Graph-Based Retrieval-Augmented Generation: Applications, Challenges, Solutions, and Opportunities |
2026 |
VLDB |
4.9793485e-05 |
| 11,045 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
4.9793485e-05 |
| 11,220 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.9793485e-05 |
| 11,251 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.9793485e-05 |
| 11,257 |
ACE: A Cardinality Estimator for Set-Valued Queries |
2025 |
VLDB |
4.9793485e-05 |
| 11,321 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
4.9793485e-05 |
| 11,580 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.9793485e-05 |
| 11,916 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.9793485e-05 |