23 citations · 26 across the 8 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022
Extracting Densest Sub-hypergraph with Convex Edge-weight Functions
Yi Zhou, Shan Hu, Zimo Sheng
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 t…
cs.DS2022★ 23 cited
Listing Maximal k-Plexes in Large Real-World Graphs
Zhengren Wang, Yi Zhou, Mingyu Xiao +1
Listing dense subgraphs in large graphs plays a key task in varieties of network analysis applications like community detection. Clique, as the densest model, has been widely inves…
cs.DS2022
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
Ming Sun, Xinyu Wu, Yi Zhou +2
The Steiner tree problem aims to determine a minimum edge-weighted tree that spans a given set of terminal vertices from a given graph. In the past decade, a considerable number of…