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.

中文翻译：

---

高效有向密集子图发现的技术视角

该问题在图挖掘中很有用，因为密集子图通常表示值得特别注意的模式。例如，它们可以指示社交网络中的权威社区、更复杂的生物结构的积木，甚至是垃圾邮件等恶意行为。有关 DDS 应用的广泛讨论，请参见 [1, 3] 和其中的参考资料。