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)

Paper ID: h3a673680b12ba266
Venue: VLDB
Year: 2024
Pagerank: 5.382671e-05
Overall Rank: 8,178 | 45.02%
DOI: 10.14778/3681954.3681975

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,442	Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance	2026	SIGMOD	4.9793485e-05
10,445	Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks	2026	SIGMOD	4.9793485e-05
10,550	Budgeted Strong Community Search in Heterogeneous Graphs	2026	SIGMOD	4.9793485e-05
10,636	Efficient Influential Community Search over Dynamic 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
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,312	X-Blossom: Massive Parallelization of Graph Maximum Matching	2025	VLDB	4.9793485e-05
11,321	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.9793485e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
184	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00026100147
600	Massive Graph Triangulation	2013	SIGMOD	0.00015740352
645	Finding Maximal Cliques in Massive Networks by H*-graph	2010	SIGMOD	0.00015213733
657	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.0001505607
739	PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks	2011	VLDB	0.00014333298
766	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00014118259
1,180	In-Memory Subgraph Matching: An In-depth Study	2020	SIGMOD	0.00011627669
1,222	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011463714
1,663	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB	9.9441685e-05
1,788	Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs	2021	SIGMOD	9.6317563e-05
1,940	A General Framework for Estimating Graphlet Statistics via Random Walk	2017	VLDB	9.3302142e-05
2,325	(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	8.6310032e-05
2,332	Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks	2020	VLDB	8.6267865e-05
2,743	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	8.0679908e-05
3,498	COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks	2015	SIGMOD	7.2551144e-05
4,732	Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach	2022	SIGMOD	6.4461271e-05
7,810	Mining Frequent Itemsets over Uncertain Databases	2012	VLDB	5.4488716e-05
11,996	On Analyzing Graphs with Motif-Paths	2021	VLDB	4.9793485e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,507	Finding the Maximum Clique in Massive Graphs	2017	VLDB
2	4,732	Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach	2022	SIGMOD
3	1,663	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB
4	4,954	Effective Community Search over Large Star-Schema Heterogeneous Information Networks	2022	VLDB
5	7,830	Densest Multipartite Subgraph Search in Heterogeneous Information Networks	2024	VLDB
6	9,867	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,332	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,776	Influential Community Search over Large Heterogeneous Information Networks	2023	VLDB