References

  1. Noga Alon, Raphael Yuster & Uri Zwick (1997): Finding and Counting Given Length Cycles. Algorithmica 17(3), pp. 209–223, doi:10.1007/BF02523189. Available at http://link.springer.com/article/10.1007/BF02523189.
  2. Julián Aráoz & Cristina Zoltan (2015): Parallel Triangles Counting Using Pipelining. http://arxiv.org/pdf/1510.03354.pdf. Available at http://arxiv.org/abs/1510.03354.
  3. Mikhail J. Atallah & Marina Blanton (2010): Algorithms and Theory of Computation Handbook: General Concepts and Techniques, 2 edition. Chapman & Hall/CRC.
  4. Jost Berthold, Mischa Dieterle & Rita Loogen (2009): Implementing parallel Google map-reduce in Eden. In: Euro-Par 2009 Parallel Processing. Springer, pp. 990–1002, doi:10.1007/978-3-642-03869-3_91.
  5. Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela & Christian Sohler (2006): Counting triangles in data streams. In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA, pp. 253–262, doi:10.1145/1142351.1142388. Available at http://dl.acm.org/citation.cfm?doid=1142351.1142388.
  6. Shumo Chu & James Cheng (2012): Triangle Listing in Massive Networks. ACM Trans. Knowl. Discov. Data 6(4), pp. 17:1–17:32, doi:10.1145/2382577.2382581.
  7. Jonathan Cohen (2009): Graph Twiddling in a MapReduce World. Computing in Science and Engineering 11(4), pp. 29–41, doi:10.1109/MCSE.2009.120. Available at http://ieeexplore.ieee.org/document/5076317/.
  8. Tyson Condie, Neil Conway, Peter Alvaro, Joseph M. Hellerstein, Khaled Elmeleegy & Russell Sears (2010): MapReduce Online. In: Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, NSDI'10. USENIX Association, Berkeley, CA, USA, pp. 21–21. Available at http://dl.acm.org/citation.cfm?id=1855711.1855732.
  9. Camil Demetrescu (2010): 9th DIMACS Implementation Challenge. http://www.dis.uniroma1.it/challenge9/download.shtml.
  10. Laboratori de Recerca i Desenvolupament (RDlab)-UPC (2016): RdLab Manual. https://rdlab.cs.upc.edu/docu/html/manual_cluster/ClusterQuickstart_en.html.
  11. Alan A.A. Donovan & Brian W. Kernighan (2015): The Go Programming Language, 1st edition. Addison-Wesley Professional.
  12. Go website. Google (2016): Go version. https://blog.golang.org/go1.6.
  13. Xiaocheng Hu, Miao Qiao & Yufei Tao (2015): Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration. In: Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pp. 291–301, doi:10.1145/2745754.2745768. Available at http://dl.acm.org/citation.cfm?doid=2745754.2745768.
  14. Xiaocheng Hu, Yufei Tao & Chin-Wan Chung (2014): I/O-Efficient Algorithms on Triangle Listing and Counting. ACM Trans. Database Syst. 39(4), pp. 27:1–27:30, doi:10.1145/2691190.2691193. Available at http://dl.acm.org/citation.cfm?doid=2691190.2691193.
  15. Konstantin Kutzkov & Rasmus Pagh (2014): Triangle Counting in Dynamic Graph Streams. In: Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings, pp. 306–318, doi:10.1007/978-3-319-08404-6_27. Available at http://dblp.uni-trier.de/rec/bib/conf/swat/KutzkovP14a.
  16. Jure Leskovec (2016): Social circles: Facebook. http://snap.stanford.edu/data/egonets-Facebook.html.
  17. Jimmy Lin & Chris Dyer (2010): Data-Intensive Text Processing with MapReduce. Synthesis Lectures on Human Language Technologies. Morgan & Claypool Publishers, doi:10.2200/S00274ED1V01Y201006HLT007.
  18. Donald Miner & Adam Shook (2013): MapReduce Design Patterns : building effective algorithms and analytics for Hadoop and other systems. O'Reilly, Beijing, Köln, u.a.. Available at http://opac.inria.fr/record=b1134500. DEBSZ.
  19. Rasmus Pagh & Charalampos E. Tsourakakis (2012): Colorful triangle counting and a MapReduce implementation. Inf. Process. Lett. 112(7), pp. 277–281, doi:10.1016/j.ipl.2011.12.007.
  20. Edelmira Pasarella, Maria-Esther Vidal & Cristina Zoltan (2016): MapReduce vs. Pipelining Counting Triangles. In: Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016. Available at http://ceur-ws.org/Vol-1644/paper33.pdf.
  21. Mahmudur Rahman & Mohammad Al Hasan (2013): Approximate triangle counting algorithms on multi-cores. In: Proceedings of the 2013 IEEE International Conference on Big Data, 6-9 October 2013, Santa Clara, CA, USA, pp. 127–133, doi:10.1109/BigData.2013.6691744.
  22. Dryad Digital Repository (2016): Dryad. http://datadryad.org/.
  23. Siddharth Suri & Sergei Vassilvitskii (2011): Counting Triangles and the Curse of the Last Reducer. In: Proceedings of the 20th International Conference on World Wide Web, WWW '11. ACM, New York, NY, USA, pp. 607–614, doi:10.1145/1963405.1963491.
  24. Leslie G. Valiant (1990): A Bridging Model for Parallel Computation. Commun. ACM 33(8), pp. 103–111, doi:10.1145/79173.79181.
  25. Tom White (2009): Hadoop - The Definitive Guide: MapReduce for the Cloud. O'Reilly. Available at http://www.oreilly.de/catalog/9780596521974/index.html.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org