Abstract
Densest subgraph discovery (DSD) is a fundamental problem in graph mining It has been studied for decades, and is widely used in various areas, includ......
小提示:本篇文献需要登录阅读全文,点击跳转登录