| 2,286 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0982591e-05 |
| 3,321 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
7.223972e-05 |
| 3,492 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.044442e-05 |
| 3,575 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
6.9528126e-05 |
| 4,145 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4122551e-05 |
| 4,270 |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy |
2024 |
SIGMOD |
6.3067205e-05 |
| 4,344 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.2744553e-05 |
| 4,459 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1651553e-05 |
| 4,534 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.1049756e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0399035e-05 |
| 4,743 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9586508e-05 |
| 5,265 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
5.5972878e-05 |
| 5,355 |
Anchored Densest Subgraph |
2022 |
SIGMOD |
5.5517073e-05 |
| 5,540 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4498271e-05 |
| 5,589 |
Neighborhood-based Hypergraph Core Decomposition |
2023 |
VLDB |
5.4216989e-05 |
| 6,183 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1667703e-05 |
| 6,513 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5.0321577e-05 |
| 6,795 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9242446e-05 |
| 6,880 |
Theoretically and Practically Efficient Parallel Nucleus Decomposition |
2022 |
VLDB |
4.8970985e-05 |
| 7,451 |
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks |
2023 |
SIGMOD |
4.7263711e-05 |
| 7,804 |
RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs |
2021 |
VLDB |
4.6466513e-05 |
| 9,228 |
Efficiently Counting Triangles in Large Temporal Graphs |
2025 |
SIGMOD |
4.3690661e-05 |
| 9,244 |
Densest Multipartite Subgraph Search in Heterogeneous Information Networks |
2024 |
VLDB |
4.3690661e-05 |
| 9,403 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3441378e-05 |
| 9,557 |
An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3254416e-05 |
| 9,647 |
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers |
2024 |
VLDB |
4.3109001e-05 |
| 9,951 |
Parallel Colorful h-star Core Maintenance in Dynamic Graphs |
2023 |
VLDB |
4.2405999e-05 |
| 10,072 |
Efficient and Scalable Directed Densest Subgraph Discovery |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,490 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,517 |
Faster and Efficient Density Decomposition via Proportional Response with Exponential Momentum |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,535 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1945683e-05 |
| 10,681 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
4.1945683e-05 |
| 10,865 |
Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs |
2025 |
VLDB |
4.1945683e-05 |
| 10,947 |
Parallel Algorithms for Hierarchical Nucleus Decomposition |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,303 |
Density Personalized Group Query |
2023 |
VLDB |
4.1945683e-05 |
| 11,410 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1945683e-05 |