@InProceedings{10.1007/978-3-319-15612-5_2,
author="Chakaravarthy, Venkatesan
and Gupta, Neelima
and Pancholi, Aditya
and Roy, Sambuddha",
editor="Rahman, M. Sohel
and Tomita, Etsuji",
title="Fast Algorithms for Constrained Graph Density Problems",
booktitle="WALCOM: Algorithms and Computation",
year="2015",
publisher="Springer International Publishing",
address="Cham",
pages="8--19",
abstract="We consider the question of finding communities in large social networks. In literature and practice, ``communities'' refer to a well-connected subgraph of the entire network. For instance, the notion of graph density has been considered as a reasonable measure of a community. Researchers have also looked at the minimum degree of a subgraph as a measure of the connectedness of the community.",
isbn="978-3-319-15612-5"
}