Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions

@inproceedings{Sariyce2015FindingTH,
title={Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions},
author={Ahmet Erdem Sariy{\"u}ce and Seshadhri Comandur and Ali Pinar and {\"U}mit V. Çataly{\"u}rek},
booktitle={WWW '15},
year={2015}
}

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 identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. Current dense… CONTINUE READING