46 citations · 86 across the 11 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
From Enumeration to Covering: Near-Optimal Densest P-Partite Subgraph Search over Large Heterogeneous Information Networks
Lu Chen, Chengfei Liu, Rui Zhou +2
Given a heterogeneous information network (HIN) and a query meta-path P of length i, the densest P-partite subgraph problem finds the subgraph, spanning the i typed layers of P, th…
cs.DS2020★ 1 cited
Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs
Lu Chen, Chengfei Liu, Rui Zhou +2
Given a bipartite graph, the maximum balanced biclique (\textsf{MBB}) problem, discovering a mutually connected while equal-sized disjoint sets with the maximum cardinality, plays…