Local triangle-densest subgraphs


Finding dense subgraphs in large graphs is a key primitive in a variety of real-world application domains, encompassing social network analysis, event detection, problems arising in biology and many others. Several recent works have studied some variants of the classical densest subgraph problem, considering alternative quality measures such as the average… (More)
DOI: 10.1109/ASONAM.2016.7752210


3 Figures and Tables

Cite this paper

@article{Samusevich2016LocalTS, title={Local triangle-densest subgraphs}, author={Raman Samusevich and Maximilien Danisch and Mauro Sozio}, journal={2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)}, year={2016}, pages={33-40} }