TY - JOUR AU - Fisher, D. AU - DeLine, R. AU - Czerwinski, M. AU - Drucker, S. PY - 2012 DA - 2012// TI - Interactions with big data analytics JO - Interactions VL - 19 UR - https://doi.org/10.1145/2168931.2168943 DO - 10.1145/2168931.2168943 ID - Fisher2012 ER - TY - JOUR AU - Kambatla, K. AU - Kollias, G. AU - Kumar, V. AU - Grama, A. PY - 2014 DA - 2014// TI - Trends in big data analytics JO - J Parallel Distrib Comput VL - 74 UR - https://doi.org/10.1016/j.jpdc.2014.01.003 DO - 10.1016/j.jpdc.2014.01.003 ID - Kambatla2014 ER - TY - JOUR AU - Herodotou, H. AU - Lim, H. AU - Luo, G. AU - Borisov, N. AU - Dong, L. AU - Cetin, F. B. AU - Babu, S. PY - 2011 DA - 2011// TI - Starfish: A self-tuning system for big data analytics JO - CIDR VL - 11 ID - Herodotou2011 ER - TY - STD TI - Peshkin L. Structure induction by lossless graph compression. arXiv preprint arXiv:cs/0703132. 2007. UR - http://arxiv.org/abs/cs/0703132 ID - ref4 ER - TY - JOUR AU - Gupta, A. AU - Verdú, S. PY - 2009 DA - 2009// TI - Nonlinear sparse-graph codes for lossy compression JO - IEEE Trans Inf Theory VL - 55 UR - https://doi.org/10.1109/TIT.2009.2016040 DO - 10.1109/TIT.2009.2016040 ID - Gupta2009 ER - TY - STD TI - Rossi RA, Gleich DF, Gebremedhin AH, Patwary M, Ali M. Parallel maximum clique algorithms with applications to network analysis and storage, vol 10. arXiv preprint arXiv:1302.6256. 2013. UR - http://arxiv.org/abs/1302.6256 ID - ref6 ER - TY - STD TI - Tomita E, Sutani Y, Higashi T, Takahashi S, Wakatsuki M. A simple and faster branch-and-bound algorithm for finding a maximum clique. In: WALCOM: Algorithms and computation. 2010. p. 191–203. ID - ref7 ER - TY - JOUR AU - San Segundo, P. AU - Rodríguez-Losada, D. AU - Jiménez, A. PY - 2011 DA - 2011// TI - An exact bit-parallel algorithm for the maximum clique problem JO - Comput Oper Res VL - 38 UR - https://doi.org/10.1016/j.cor.2010.07.019 DO - 10.1016/j.cor.2010.07.019 ID - San Segundo2011 ER - TY - JOUR AU - Pullan, W. J. AU - Hoos, H. H. PY - 2006 DA - 2006// TI - Dynamic local search for the maximum clique problem JO - JAIR VL - 25 ID - Pullan2006 ER - TY - STD TI - Pattillo J, Youssef N, Butenko S. Clique relaxation models in social network analysis. Handbook of optimization in complex networks. Springer; 2012. p. 143–62. ID - ref10 ER - TY - JOUR AU - Balasundaram, B. AU - Butenko, S. AU - Hicks, I. AU - Sachdeva, S. PY - 2011 DA - 2011// TI - Clique relaxations in social network analysis: the maximum k-plex problem JO - Oper Res. VL - 59 UR - https://doi.org/10.1287/opre.1100.0851 DO - 10.1287/opre.1100.0851 ID - Balasundaram2011 ER - TY - JOUR AU - Alba, R. D. PY - 1973 DA - 1973// TI - A graph-theoretic definition of asociometric clique JO - J Math Soc VL - 3 UR - https://doi.org/10.1080/0022250X.1973.9989826 DO - 10.1080/0022250X.1973.9989826 ID - Alba1973 ER - TY - STD TI - Harish P, Narayanan P. Accelerating large graph algorithms on the GPU using cuda. In: HiPC. 2007. p. 197–208. ID - ref13 ER - TY - STD TI - Vineet V, Narayanan P. Cuda cuts: fast graph cuts on the gpu. In: Computer vision and pattern recognition workshops (CVPRW). 2008. p. 1–8. ID - ref14 ER - TY - STD TI - Zhou R. System and method for selecting useful smart kernels for general-purpose GPU computing. US Patent 20,150,324,707. 2015. ID - ref15 ER - TY - JOUR AU - Liu, X. AU - Li, M. AU - Li, S. AU - Peng, S. AU - Liao, X. AU - Lu, X. PY - 2014 DA - 2014// TI - Imgpu: Gpu-accelerated influence maximization in large-scale social networks JO - IEEE Trans Parallel Distrib Syst VL - 25 UR - https://doi.org/10.1109/TPDS.2013.41 DO - 10.1109/TPDS.2013.41 ID - Liu2014 ER - TY - STD TI - Pan Y, Wang Y, Wu Y, Yang C, Owens JD. Multi-gpu graph analytics. arXiv preprint arXiv:1504.04804. 2015. UR - http://arxiv.org/abs/1504.04804 ID - ref17 ER - TY - STD TI - Ryoo S, Rodrigues CI, Baghsorkhi SS, Stone SS, Kirk DB, Hwu WW. Optimization principles and application performance evaluation of a multithreaded gpu using cuda. In: SIGPLAN. New York: ACM; 2008, p. 73–82. ID - ref18 ER - TY - STD TI - Zhou R. Systems and methods for efficient sparse matrix representations with applications to sparse matrix-vector multiplication and PageRank on the GPU. 2015. ID - ref19 ER - TY - STD TI - Kepner J, Gilbert J. Graph algorithms in the language of linear algebra. In: SIAM. 2011. ID - ref20 ER - TY - BOOK AU - Landesberger, T. AU - Kuijper, A. AU - Schreck, T. AU - Kohlhammer, J. AU - Wijk, J. J. AU - Fekete, J. D. AU - Fellner, D. W. PY - 2011 DA - 2011// TI - Visual analysis of large graphs: state-of-the-art and future research challenges PB - Wiley Online Library CY - New York ID - Landesberger2011 ER - TY - STD TI - Ahmed NK, Rossi RA. Interactive visual graph analytics on the web. In: ICWSM. 2015, p. 566–9. ID - ref22 ER - TY - JOUR AU - Traud, A. L. AU - Mucha, P. J. AU - Porter, M. A. PY - 2011 DA - 2011// TI - Social structure of facebook networks JO - Phys A Stat Mech Appl VL - 391 UR - https://doi.org/10.1016/j.physa.2011.12.021 DO - 10.1016/j.physa.2011.12.021 ID - Traud2011 ER - TY - JOUR AU - Girvan, M. AU - Newman, M. E. J. PY - 2002 DA - 2002// TI - Community structure in social and biological networks JO - PNAS VL - 99 UR - https://doi.org/10.1073/pnas.122653799 DO - 10.1073/pnas.122653799 ID - Girvan2002 ER - TY - STD TI - Chierichetti F, Kumar R, Lattanzi S, Mitzenmacher M, Panconesi A, Raghavan P. On compressing social networks. SIGKDD, 2009. p. 219–28. ID - ref25 ER - TY - STD TI - Grabowski S, Bieniecki W. Tight and simple web graph compression. arXiv preprint arXiv:1006.0809. 2010. UR - http://arxiv.org/abs/1006.0809 ID - ref26 ER - TY - STD TI - Buehrer G, Chellapilla K. A scalable pattern mining approach to web graph compression with communities. In: WSDM. New York: ACM; 2008. p. 95–106. ID - ref27 ER - TY - STD TI - Boldi P, Vigna S. The webgraph framework i: compression techniques. In: WWW. 2004. p. 595–602. ID - ref28 ER - TY - STD TI - Suel T, Yuan J. Compressing the graph structure of the web. In: IEEE data compression conference. 2001. p. 213–22. ID - ref29 ER - TY - STD TI - Kempe D, Kleinberg J, Kumar A. Connectivity and inference problems for temporal networks. STOC, 2000. p. 504–13. ID - ref30 ER - TY - STD TI - Ahmed NK, Berchmans F, Neville J, Kompella R. Time-based sampling of social network activity graphs. In: SIGKDD MLG. 2010. p. 1–9. ID - ref31 ER - TY - STD TI - Friedman N, Getoor L, Koller D, Pfeffer A. Learning probabilistic relational models. In: IJCAI. 1999. p. 1300–09. ID - ref32 ER - TY - JOUR AU - Chandola, V. AU - Banerjee, A. AU - Kumar, V. PY - 2009 DA - 2009// TI - Anomaly detection: a survey JO - ACM Comput Surv VL - 41 UR - https://doi.org/10.1145/1541880.1541882 DO - 10.1145/1541880.1541882 ID - Chandola2009 ER - TY - STD TI - Akoglu L, McGlohon M, Faloutsos C. Oddball: spotting anomalies in weighted graphs. In: Advances in knowledge discovery and data mining. 2010. p. 410–21. ID - ref34 ER - TY - JOUR AU - Eberle, W. AU - Holder, L. PY - 2007 DA - 2007// TI - Anomaly detection in data represented as graphs JO - Intell Data Anal VL - 11 ID - Eberle2007 ER - TY - JOUR AU - Rossi, R. A. AU - Ahmed, N. K. PY - 2015 DA - 2015// TI - Role discovery in networks JO - TKDE VL - 27 ID - Rossi2015 ER - TY - STD TI - Sun J, Faloutsos C, Papadimitriou S, Yu PS. Graphscope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. New York: ACM; 2007. p. 687–96. ID - ref37 ER - TY - STD TI - Prakash BA, Sridharan A, Seshadri M, Machiraju S, Faloutsos C. Eigenspokes: surprising patterns and scalable community chipping in large graphs. In: Advances in knowledge discovery and data mining. 2010. p. 435–48. ID - ref38 ER - TY - JOUR AU - Leskovec, J. AU - Lang, K. J. AU - Dasgupta, A. AU - Mahoney, M. W. PY - 2009 DA - 2009// TI - Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters JO - Internet Math VL - 6 UR - https://doi.org/10.1080/15427951.2009.10129177 DO - 10.1080/15427951.2009.10129177 ID - Leskovec2009 ER - TY - JOUR AU - Hayashida, M. AU - Akutsu, T. PY - 2010 DA - 2010// TI - Comparing biological networks via graph compression JO - BMC Syst Biol VL - 4 UR - https://doi.org/10.1186/1752-0509-4-S2-S13 DO - 10.1186/1752-0509-4-S2-S13 ID - Hayashida2010 ER - TY - STD TI - Ketkar NS, Holder LB, Cook DJ. Subdue: compression-based frequent pattern discovery in graph data. In: Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations. New York: ACM; 2005. p. 71–6. ID - ref41 ER - TY - STD TI - Ahmed NK, Duffield N, Neville J, Kompella R. Graph sample and hold: a framework for big-graph analytics. In: SIGKDD. New York: ACM; 2014. p. 1446–55. ID - ref42 ER - TY - STD TI - Margaritis D, Faloutsos C, Thrun S. Netcube: a scalable tool for fast data mining and compression. VLDB, 2001. ID - ref43 ER - TY - JOUR AU - Rossi, R. A. AU - Ahmed, N. K. PY - 2014 DA - 2014// TI - Coloring large complex networks JO - Soc Net Anal Mining VL - 4 ID - Rossi2014 ER - TY - STD TI - Boldi P, Rosa M, Santini M, Vigna S. Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. WWW. New York: ACM; 2011. p. 587–96. ID - ref45 ER - TY - STD TI - Rossi RA, Ahmed NK. The network data repository with interactive graph analytics and visualization. In: Proceedings of the 29th AAAI conference on artificial intelligence. 2015. p. 4292–93. http://networkrepository.com UR - http://networkrepository.com ID - ref46 ER -