Densest Multipartite Subgraph Search in Heterogeneous Information Networks

Summary: Defines densest P‑partite subgraph in HINs: density = #meta-path P instances / geometric mean of the i part sizes to capture cohesive multi-type groups. Exact Theta(|M|) min-cut and 1/i-approx algorithms; pruning reduces instances to o(|M|) (70–90% pruned). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 13748
Venue: VLDB
Year: 2024
Pagerank: 5.3572577e-05
Overall Rank: 9,259 | 35.65%
DOI: 10.14778/3636218.3636226

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,072	Efficient and Scalable Directed Densest Subgraph Discovery	2026	SIGMOD	5.1725247e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
844	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00013704523
1,352	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.0001116702
1,693	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB	0.00010080767
2,060	Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs	2021	SIGMOD	9.3094161e-05
2,306	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	8.8599547e-05
2,408	Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks	2020	VLDB	8.7014297e-05
2,461	Efficient Algorithms for Maximal k-Biplex Enumeration	2022	SIGMOD	8.6210174e-05
4,192	Butterfly-Core Community Search over Labeled Graphs	2021	VLDB	6.9070287e-05
4,867	A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery	2022	SIGMOD	6.534803e-05
5,197	Effective Community Search over Large Star-Schema Heterogeneous Information Networks	2022	VLDB	6.3913183e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,702	Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain	2025	VLDB	5.1725247e-05
8,695	Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks	2024	VLDB	5.4478131e-05
5,434	DMCS : Density Modularity based Community Search	2022	SIGMOD	6.292015e-05
10,500	Integral Densest Subgraph Search on Directed Graphs	2025	SIGMOD	5.1725247e-05
10,865	Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks	2025	VLDB	5.1725247e-05
9,551	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD	5.316206e-05
5,036	Influential Community Search over Large Heterogeneous Information Networks	2023	VLDB	6.45867e-05
5,197	Effective Community Search over Large Star-Schema Heterogeneous Information Networks	2022	VLDB	6.3913183e-05
2,408	Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks	2020	VLDB	8.7014297e-05
1,693	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB	0.00010080767