HADI: Fast Diameter Estimation and Mining in Massive Graphs with Hadoop

Abstract

How can we quickly find the diameter of a petabyte-sized graph? Large graphs are ubiquitous: social networks (Facebook, LinkedIn, etc.), the World Wide Web, biological networks, computer networks and many more. The size of graphs of interest has been increasing rapidly in recent years and with it also the need for algorithms that can handle teraand peta… (More)

Topics

11 Figures and Tables

Statistics

0510152009201020112012201320142015201620172018
Citations per Year

74 Citations

Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Kang2008HADIFD, title={HADI: Fast Diameter Estimation and Mining in Massive Graphs with Hadoop}, author={U. Kang and Charalampos E. Tsourakakis and Ana Paula Appel and Christos Faloutsos and Jure Leskovec and Charalampos}, year={2008} }