CCF: Fast and scalable connected component computation in MapReduce

@article{Kardes2014CCFFA,
  title={CCF: Fast and scalable connected component computation in MapReduce},
  author={Hakan Kardes and Siddharth Agrawal and Xin Wang and Ang Sun},
  journal={2014 International Conference on Computing, Networking and Communications (ICNC)},
  year={2014},
  pages={994-998}
}
Finding connected components in a graph is a well-known problem in a wide variety of application areas such as social network analysis, data mining, image processing, and etc. In this paper, we present an efficient and scalable approach in MapReduce to find all the connected components in a given graph. We compare our approach with the state-of-the-art on a real-world graph. We also demonstrate the viability of our approach on a massive graph with ~6B nodes and ~92B edges on an 80-node hadoop… CONTINUE READING
5 Citations
10 References
Similar Papers

References

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

The case for cost-sensitive and easy-to-interpret models in industrial record linkage

  • S. Chen, A. Borthwick, V. Carvalho
  • 2011.
  • 2011
1 Excerpt

Mining Graph Data

  • D. J. Cook, L. B. Holder
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…