Database Paper Browser

Back to papers

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
13747
Venue
VLDB
Year
2024
Pagerank
4.3690661e-05
Overall Rank
9,244 | 35.70%
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 4.1945683e-05
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers