首页 正文

A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks

{{output}}
The use of networks for modelling and analysing relations among data is currently growing. Recently, the use of a single networks for capturing all the aspects of some complex scenarios has shown some limitations. Consequently, it has been proposed to use Dual... ...