Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks
Summary: Efficient maximal motif-clique enumeration in large HINs via an order-based duplicate-free framework, pivot pruning, and optimized candidate/subgraph processing. Experiments on five real networks show up to 10³× speedups over the state of the art. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yingli Zhou (Chinese University of Hong Kong)
- 2. Yixiang Fang (Chinese University of Hong Kong)
- 3. Chenhao Ma (Chinese University of Hong Kong)
- 4. Tianci Hou (Chinese University of Hong Kong)
- 5. Xin Huang (Hong Kong Baptist University)
BibTeX Citation
@article{zhou_vldb24,
title = {{Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks}},
author = {Zhou, Yingli and Fang, Yixiang and Ma, Chenhao and Hou, Tianci and Huang, Xin},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {11},
pages = {2946--2959},
doi = {10.14778/3681954.3681975},
url = {https://doi.org/10.14778/3681954.3681975},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,454 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD | 4.9769913e-05 |
| 10,456 | Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks | 2026 | SIGMOD | 4.9769913e-05 |
| 10,561 | Budgeted Strong Community Search in Heterogeneous Graphs | 2026 | SIGMOD | 4.9769913e-05 |
| 10,647 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD | 4.9769913e-05 |
| 10,718 | A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs | 2026 | VLDB | 4.9769913e-05 |
| 11,054 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB | 4.9769913e-05 |
| 11,228 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB | 4.9769913e-05 |
| 11,320 | X-Blossom: Massive Parallelization of Graph Maximum Matching | 2025 | VLDB | 4.9769913e-05 |
| 11,329 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 4.9769913e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,508 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB |
| 2 | 4,733 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD |
| 3 | 1,664 | Effective and Efficient Community Search over Large Heterogeneous Information Networks | 2020 | VLDB |
| 4 | 4,956 | Effective Community Search over Large Star-Schema Heterogeneous Information Networks | 2022 | VLDB |
| 5 | 7,834 | Densest Multipartite Subgraph Search in Heterogeneous Information Networks | 2024 | VLDB |
| 6 | 9,874 | Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks | 2025 | VLDB |
| 7 | 1,616 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 8 | 2,334 | Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks | 2020 | VLDB |
| 9 | 645 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD |
| 10 | 4,780 | Influential Community Search over Large Heterogeneous Information Networks | 2023 | VLDB |