AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频

生成解读视频

AI 溯源

AI解析本论文相关学术脉络

生成溯源树

Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions.

Proceedings of the 24th International Conference on World Wide Web, pp.927-937, (2015)

引用：103|浏览73

下载 PDF 全文

原文链接

其它链接

dblp.uni-trier.de dl.acm.org academic.microsoft.com arxiv.org

引用

关键词

k-core k-truss graph decomposition density hierarchy overlapping dense subgraphs更多(1+)

摘要

Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most standard formulations of this problem (like clique, quasiclique, k-densest subgraph) are NP-hard. Furthermore, the goal is rarely to find the true optimum, but to i...更多

代码：

数据：

下载 PDF 全文

PPT (上传PPT)

相似论文

引用论文

被引论文

作者