Kavli Affiliate: Yi Zhou | First 5 Authors: Yi Zhou, Shan Hu, Zimo Sheng, , | Summary: The densest subgraph problem (DSG) aiming at finding an induced subgraph such that the average edge-weights of the subgraph is maximized, is a well-studied problem. However, when the input graph is a hypergraph, the existing notion of DSG […]
Continue.. Extracting Densest Sub-hypergraph with Convex Edge-weight Functions