An efficient MapReduce algorithm for counting triangles in a very large graph.
| Anthology ID: | DBLP:conf/cikm/ParkC13 |
|---|---|
| Volume: | 22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013 |
| Year: | 2013 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 539-548 |
| URL: | https://doi.org/10.1145/2505515.2505563 |
| DOI: | https://doi.org/10.1145/2505515.2505563 |
| DBLP: | conf/cikm/ParkC13 |
| BibTeX: |
@inproceedings{park-2013-efficient,
author = {Ha-Myung Park and
Chin-Wan Chung},
editor = {Qi He and
Arun Iyengar and
Wolfgang Nejdl and
Jian Pei and
Rajeev Rastogi},
title = {{An efficient MapReduce algorithm for counting triangles in a very large graph}},
booktitle = {{22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013}},
pages = {539--548},
publisher = {ACM},
year = {2013},
url = {https://doi.org/10.1145/2505515.2505563},
doi = {https://doi.org/10.1145/2505515.2505563}
}