说明: A survey of algorithms for dense subgraph discovery is presented in this paper. The problem of dense subgraph discovery is closely related to clustering though the two problems also have a number of differences. For example, the problem of clusterin
<boboslulu> 上传 | 大小:919kb