Densest Multipartite Subgraph Search in Heterogeneous Information Networks
Summary: Introduces densest P-partite subgraph search in HINs, scoring meta-path instances against the geometric mean of participating vertex-set sizes. Exact min-cut and 1/i-approximation algorithms are proposed, with pruning removing 70–90% of candidate instances. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lu Chen (Swinburne University of Technology)
- 2. Chengfei Liu (Swinburne University of Technology)
- 3. Rui Zhou (Swinburne University of Technology)
- 4. Kewen Liao (Australian Catholic University)
- 5. Jiajie Xu (Soochow University)
- 6. Jianxin Li (Deakin University)
BibTeX Citation
@article{chen_vldb24,
title = {{Densest Multipartite Subgraph Search in Heterogeneous Information Networks}},
author = {Chen, Lu and Liu, Chengfei and Zhou, Rui and Liao, Kewen and Xu, Jiajie and Li, Jianxin},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {4},
pages = {699--711},
doi = {10.14778/3636218.3636226},
url = {https://doi.org/10.14778/3636218.3636226},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,226 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD | 5.093636e-05 |
| 10,229 | Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks | 2026 | SIGMOD | 5.093636e-05 |
| 10,363 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 5.093636e-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