Discovering Large Dense Subgraphs in Massive Graphs

  title={Discovering Large Dense Subgraphs in Massive Graphs},
  author={David Gibson and Ravi Kumar and Andrew Tomkins},
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extremely efficient, capable of handling graphs with tens of billions of edges on a single machine with modest resources. We apply our algorithm to characterize the large, dense subgraphs of a graph showing connections between hosts on the World Wide Web; this graph contains over 50M hosts and 11B edges, gathered from 2.1B web… CONTINUE READING
Highly Influential
This paper has highly influenced 17 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 358 citations. REVIEW CITATIONS
229 Citations
26 References
Similar Papers


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

358 Citations

Citations per Year
Semantic Scholar estimates that this publication has 358 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…