[1] Hidalgo J M G, Bringas G C, Sanz E P, Garcia F C. Contentbased SMS spam filtering. In Proc. the 2006 ACM Symposiumon Document Engineering, Amsterdam, Netherlands,Oct. 10-13, 2006, pp.107-114.[2] http://www.isc.org.cn/zxzx/xhdt/listinfo-1532.html.[3] Boykin P O, Roychowdhury V P. Leveraging social networksto fight spam. Computer, April 2005, 38(4): 61-68.[4] Yoo S, Yang Y, Lin F, Moon I. Mining social networks forpersonalized email prioritization. In Proc. the 15th ACMSIGKDD, Paris, France, June 28-July 1, 2009, pp.967-976.[5] Gomes L H, Almeida R B, Bettencourt L M A, Almeida V,Almeida J M. Comparative graph theoretical characterizationof networks of spam and legitimate email. In Proc. Conf.Email and Anti-Spam, California, CA, USA, July 21-22, 2005.[6] Newman M E J. Modularity and community structure innetworks. Proceedings of National Academy of Sciences ofU.S.A., May 2006, 103(23): 8577-8582.[7] Goldberg A V. Finding a maximum density subgraph. Tech-nical Report, Uni. California, Berkeley, 1984. http://www.eecs.berkeley.edu/Pubs/TechRpts/1984/CSD-84-171.pdf.[8] Grandoni F. A note on the complexity of minimum dominat-ing set. J. Discrete Algorithms, June 2006, 4(2): 209-214.[9] Edmonds J. Paths, trees, and flowers. Canadian Journal ofMathematics, 1965, 17(3): 449-467.[10] Knuth D. Dancing links. Millennial Perspectives in ComputerScience, Nov. 2000: 187-214.[11] Almeida V, Bestavros A, Crovella M, de Oliveira A. Chara-cterizing reference locality in the WWW. In Proc. the 4th Int.Conf. Parallel and Distributed Information Systems, MiamiBeach, USA, Dec. 18-20, 1996, pp.92-103. |