Finding Subgraphs with Maximum Total Density and Limited Overlap

@inproceedings{Balalau2015FindingSW,
  title={Finding Subgraphs with Maximum Total Density and Limited Overlap},
  author={Oana Denisa Balalau and Francesco Bonchi and T.-H. Hubert Chan and Francesco Gullo and Mauro Sozio},
  booktitle={WSDM},
  year={2015}
}
Finding dense subgraphs in large graphs is a key primitive in a variety of real-world application domains, encompassing social network analytics, event detection, biology, and finance. In most such applications, one typically aims at finding several (possibly overlapping) dense subgraphs which might correspond to communities in social networks or interesting events. While a large amount of work is devoted to finding a single densest subgraph, perhaps surprisingly, the problem of finding several… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS
26 Citations
3 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Similar Papers

Loading similar papers…