[1] Alon N,Yuster R,Zwick U.Finding and counting given length cycles[J].Algorithmica,1997,17(3):209-223.
[2] Schank T,Wagner D.Finding,counting and listing all triangles in large graphs,an experimental study[J].Lecture Notes in Computer Science,2005,3503:606-609.
[3] Chiba N,Nishizeki T.Arboricity and subgraph listing algorithms[J].Siam Journal on Computing,1985,14(1):210-223.
[4] Latapy M.Main-memory triangle computations for very large (sparse (power-law)) graphs[J].Theoretical Computer Science,2008,407(1-3):458-473.
[5] Chu S,Cheng J.Triangle listing in massive networks and its applications[A].ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].San Diego,California,USA:ACM,2011.672-680.
[6] Suri S,Vassilvitskii S.Counting triangles and the curse of the last reducer[A].International Conference on World Wide Web[C].Hyderabad,India:ACM,2011.607-614.
[7] Park H M,Chung C W.An efficient MapReduce algorithm for counting triangles in a very large graph[A].ACM Conference of Information and Knowledge Management[C].San Francisco,CA,USA:ACM,2013.539-548.
[8] Park H M,Silvestri F,Kang U,et al.MapReduce triangle enumeration with guarantees[A].ACM International Conference on Conference on Information and Knowledge Management[C].Shanghai,China:ACM,2014.1739-1748.
[9] Hu X,Tao Y,Chung C W.I/O-efficient algorithms on triangle listing and counting[J].Acm Transactions on Database Systems,2014,39(4):1-30.
[10] Jowhari H,Ghodsi M.New streaming algorithms for counting triangles in graphs[J].Lecture Notes in Computer Science,2005,3595:710-716.
[11] Buriol L S,Frahling G,Leonardi S,et al.Counting triangles in data streams[A].PODS'06 Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database[C].Chicago,Illinois,USA:ACM,2006.253-262.
[12] Pavan A,Tangwongsan K,Tirthapura S,et al.Counting and sampling triangles from a graph stream[J].Proceedings of the Vldb Endowment,2013,6(14):1870-1881.
[13] Lim Y,Kang U.MASCOT:memory-efficient and accurate sampling for counting local triangles in graph streams[A].21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD[C].Sydney,NSW,Australia:ACM Press,2015.685-694.
[14] Tsourakakis C E,Kang U,Miller G L,et al.DOULION:counting triangles in massive graphs with a coin[A].ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].Paris,France:DBLP,2009.837-846.
[15] Bulteau L,Froese V,Kutzkov K,et al.Triangle counting in dynamic graph streams[J].Algorithmica,2016,8503(1):1-20.
[16] 姚苏,关建峰,潘华,张宏科.基于APT潜伏攻击的网络可生存性模型与分析[J].电子学报,2016,44(10):2415-2422. YAO Su,GUAN Jian-feng,Pan Hua,Zhang Hong-ke.Modeling and Analysis for Network Survivability of APT Latent Attack[J].Acta Electronica Sinica,2016,44(10):2415-2422.(in Chinese) |