PATRIC: a parallel algorithm for counting triangles in massive networks. Arifuzzaman, S., Khan, M., & Marathe, M. V. In He, Q., Iyengar, A., Nejdl, W., Pei, J., & Rastogi, R., editors, CIKM, pages 529-538, 2013. ACM.
PATRIC: a parallel algorithm for counting triangles in massive networks. [link]Link  PATRIC: a parallel algorithm for counting triangles in massive networks. [link]Paper  bibtex   
@inproceedings{conf/cikm/ArifuzzamanKM13,
  added-at = {2018-11-06T00:00:00.000+0100},
  author = {Arifuzzaman, Shaikh and Khan, Maleq and Marathe, Madhav V.},
  biburl = {https://www.bibsonomy.org/bibtex/2698f281807aa268aa888bb4e1b0a0f50/dblp},
  booktitle = {CIKM},
  crossref = {conf/cikm/2013},
  editor = {He, Qi and Iyengar, Arun and Nejdl, Wolfgang and Pei, Jian and Rastogi, Rajeev},
  ee = {https://doi.org/10.1145/2505515.2505545},
  interhash = {38aa0cff1a51be5977e8b84f2d836dac},
  intrahash = {698f281807aa268aa888bb4e1b0a0f50},
  isbn = {978-1-4503-2263-8},
  keywords = {dblp},
  pages = {529-538},
  publisher = {ACM},
  timestamp = {2018-11-07T16:49:46.000+0100},
  title = {PATRIC: a parallel algorithm for counting triangles in massive networks.},
  url = {http://dblp.uni-trier.de/db/conf/cikm/cikm2013.html#ArifuzzamanKM13},
  year = 2013
}

Downloads: 0