| 1 | D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440-442, 1998. DOI |
| 2 | Z. Yang, C. Wilson, X. Wang, T. Gao, B. Y. Zhao, and Y. Dai. Uncovering social network sybils in the wild. In SIGCOMM, pages 259-268, 2011. |
| 3 | L. Becchetti, P. Boldi, C. Castillo, and A. Gionis. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In SIGKDD, pages 16-24. ACM, 2008. |
| 4 | U Kang, B. Meeder, E. E. Papalexakis, and C. Faloutsos. Heigen: Spectral analysis for billion-scale graphs. TKDE, 26(2), 350-362, 2014. |
| 5 | J. W. Berry, B. Hendrickson, R. A. LaViolette, and C. A. Phillips. Tolerating the community detection resolution limit with edge weighting. Physical Review E, 83:056119, 2011. DOI |
| 6 | A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7(4):413-423, 1978. DOI |
| 7 | M. Latapy. Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical Computer Science, 407(1):458-473, 2008. DOI |
| 8 | T. Schank and D. Wagner. Finding, counting and listing all triangles in large graphs, an experimental study. In Experimental and Efficient Algorithms, pages 606-609. Springer, 2005. |
| 9 | Jeffrey Dean and Sanjay Ghemawat. Mapreduce: Simplified data processing on large clusters. OSDI, 2004. |
| 10 | Siddharth Suri and Sergei Vassilvitskii. Counting triangles and the curse of the last reducer. In WWW, pages 607-614, 2011. |
| 11 | Shaikh Arifuzzaman, Maleq Khan, Madhav V. Marathe. PATRIC: a parallel algorithm for counting triangles in massive networks. In CIKM 2013, pages 529-538, 2013 |
| 12 | Jonathan Cohen. Graph twiddling in a mapreduce world. Computing in Science & Engineering, 11(4):29-41, 2009. DOI |
| 13 | Ha-Myung Park, Chin-Wan Chung. An efficient MapReduce algorithm for counting triangles in a very large graph. In CIKM, pages 539-548, 2013 |
| 14 | Shumo Chu and James Cheng. Triangle listing in massive networks and its applications. In KDD, pages 672-680, 2011. |
| 15 | Jean-Pierre Eckmann and Elisha Moses. Curvature of co-links uncovers hidden thematic layers in the world wide web. PNAS, 99(9):5825-5829, 2002. DOI |
| 16 | Norishige Chiba and Takao Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. Comput., 14(1):210-223, 1985. DOI |
| 17 | Xiaocheng Hu, Yufei Tao, and Chin-Wan Chung. Massive graph triangulation. In SIGMOD, pages 325-336. ACM, 2013. |
| 18 | Rasmus Pagh and Francesco Silvestri. The Input/Output complexity of triangle enumeration. In PODS, pages 224-233, 2014. |
| 19 | Ha-Myung Park, Francesco Silvestri, U Kang, Rasmus Pagh. MapReduce Triangle Enumeration With Guarantees. In CIKM, pages to appear, 2014. |
 |
Korea Institute of Science and Technology Information
Gwahangno, Yuseong-gu, Daejeon, 305-806, Korea TEL : +82-42-869-1752
Copyright (c) 2009 KISTI. All Rights Reserved. For more information mail to
webmaster
