Technical Perspective of Efficient Directed Densest Subgraph Discovery
Yufei Tao · ACM SIGMOD Record · 2021
The problem is useful in graph mining because dense subgraphs often represent patterns deserving special attention. They could indicate, for example, an authoritative community in a social network, a building brick of more complex biology structures, or even a type of malicious behavior such as spamming. See [1, 3] and the references therein for an extensive discussion on the applications of DDS.