CC-MR - Finding Connected Components in Huge Graphs with MapReduce

Cite

Text

Seidl et al. "CC-MR - Finding Connected Components in Huge Graphs with MapReduce." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2012. doi:10.1007/978-3-642-33460-3_35

Markdown

[Seidl et al. "CC-MR - Finding Connected Components in Huge Graphs with MapReduce." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2012.](https://mlanthology.org/ecmlpkdd/2012/seidl2012ecmlpkdd-ccmr/) doi:10.1007/978-3-642-33460-3_35

BibTeX

@inproceedings{seidl2012ecmlpkdd-ccmr,
  title     = {{CC-MR - Finding Connected Components in Huge Graphs with MapReduce}},
  author    = {Seidl, Thomas and Boden, Brigitte and Fries, Sergej},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2012},
  pages     = {458-473},
  doi       = {10.1007/978-3-642-33460-3_35},
  url       = {https://mlanthology.org/ecmlpkdd/2012/seidl2012ecmlpkdd-ccmr/}
}