| References: [1] Beamer, S. (2016). Understanding and improving graph algorithm performance (Doctoral dissertation, UC Berkeley).
[2] Kwak, Haewoon., Lee, Changhyun., Park, Hosung., and Moon, Sue. (2010). What is Twitter, a social network or a news media? International World Wide Web Conference (WWW), 2010.
[3] Alan Mislove., Massimiliano Marcon., Krishna P. Gummadi., Peter Druschel., Bobby Bhattacharjee. (2007). Measurement and analysis of online social networks. Conference on Internet Measurement (IMC) 2007.
[4] Pereira-Leal, Jose B., Enright, Anton J., Ouzounis, Jaewon. (2004). Detection of functional modules from protein interaction networks. PROTEINS: Structure, Function, and Bioinformatics, 54 (1) 49–57.
[5] Yang, Jaewon., Leskovec, Jure. (2012). Defining and evaluating network communities based on ground-truth. arXiv, 1205.6233, 2012.
[6] Low, Yucheng., Gonzalez, Joseph., Kyrola, Aapo., Bickson, Danny., Guestrin, Joseph M., Hellerstein, Joseph M. (2010). GraphLab: A new framework for parallel machine learning. Uncertainty in Artificial Intelligence, 2010.
[7] You, Kisun., Chong, Jike., Yi, Youngmin., Gonina, Ekaterina., Hughes, Christopher., Chen, Yen- Kuang., Sung, Kurt., Keutzer, Kurt.(2010). Scalable HMM-based inference engine in large vocabulary continuous speech recognition. IEEE Signal Processing Magazine, 2010.
[8] Lumsdaine, Andrew., Gregor, Douglas., Hendrickson, Bruce., Berry, Jonathan. (2007). Challenges in parallel graph processing. Parallel Processing Letters, 17 (01) 5–20, 2007.
[9] Sakr, S., Orakzai, F. M., Abdelaziz, I., Khayyat, Z. (2016). Large-Scale graph processing using Apache giraph. Springer.
[10] Han, M., Daudjee, K. (2015). Giraph unchained: barrier less asynchronous parallel execution in pregel-like graph processing systems. Proceedings of the VLDB Endowment, 8 (9) 950-961.
[11] Low, Y., Gonzalez, J. E., Kyrola, A., Bickson, D., Guestrin, C. E., Hellerstein, J. (2014). Graphlab: A new framework for parallel machine learning. arXiv preprint arXiv:1408.2041.
[12] Yan, Da., Cheng, James., Lu, Yi., and Ng, Wilfred. (2014). Blogel: A block-centric framework for distributed computation on real-world graphs. PVLDB, 7(14):1981–1992, 2014.
[13] Carbone, P., Katsifodimos, A., Ewen, S., Markl, V., Haridi, S., Tzoumas, K. (2015). Apache flink: Stream and batch processing in a single engine. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 36 (4).
[14] Simmhan, Y., Kumbhare, A., Wickramaarachchi, C., Nagarkar, S., Ravi, S., Raghavendra, C., Prasanna, V. (2014, August). Goffish: A sub-graph centric framework for large-scale graph analytics. In: European Conference on Parallel Processing (p. 451- 462). Springer, Cham.
[15] Gonzalez, J. E., Xin, R. S., Dave, A., Crankshaw, D., Franklin, M. J., Stoica, I. (2014, October). GraphX: Graph Processing in a Distributed Dataflow Framework. In OSDI (Vol. 14, p. 599-613).
[16] Gerbessiotis, A. V., Valiant, L. G. (1994). Direct bulk-synchronous parallel algorithms. Journal of parallel and distributed computing, 22 (2) 251-267.
[17] Doekemeijer, N., Varbanescu, A. L. (2014). A survey of parallel graph processing frameworks. Delft University of Technology, 21.
[18] Malewicz, G., Austern, M. H., Bik, A. J., Dehnert, J. C., Horn, I., Leiser, N., Czajkowski, G. (2010, June). Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data (p. 135-146). ACM.
[19] Kabiljo, M., Logothetis, D., Edunov, S., Ching, A. (2017). A comparison of state-of-the-art graph processing systems.
[20] Hwang, K., Chen, M. (2017). Big-data analytics for cloud, IoT and cognitive computing. John Wiley & Sons.
[21] Berkhin, Pavel (2005). A survey on pagerank computing. Internet Mathematics, 2 (1) 73–120, 2005.
[22] Page, L., Brin, S., Motwani, R., Winograd, T. (1999). The PageRank citation ranking: Bringing order to the web. Stanford InfoLab.
[23] Christian Kohlschu tter, Paul-Alexandru Chirita, and Wolfgang Nejdl. Efficient parallel computation of page rank. European Conference on Information Retrieval, p. 241– 252, 2006.
[24] Di Stefano, L., Bulgarelli, A. (1999, September). A simple and efficient connected components labelling algorithm. In: ICIAAP (p. 322). IEEE.
[25] Ng, A. Y., Jordan, M. I., Weiss, Y. (2002). On spectral clustering: Analysis and an algorithm. In: Advances in neural Information Processing Systems (p. 849-856).
[26] Greiner, J. (1994, August). A comparison of parallel algorithms for connected components. In: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures (p. 16-25). ACM.
[27] Dasgupta, C. H., Vazirani, U. V. (2015). Algorithms.
[28] Shumo Chu and James Cheng. Triangle listing in massive networks and its applications. In: Conference on Knowledge Discovery and Data Mining (KDD), JunE 2011.
[29] Samsi, S., Gadepally, V., Hurley, M., Jones, M., Kao, E., Mohindra, S., Staheli, D. (2017, September). Static graph challenge: Subgraph isomorphism. In: High Performance Extreme Computing Conference (HPEC), 2017 IEEE (p. 1-6). IEEE.
[30] Kolda, T. G., Pinar, A., Plantenga, T., Seshadhri, C., Task, C. (2014). Counting triangles in massive graphs with MapReduce. SIAM Journal on Scientific Computing, 36 (5) S48-S77.
[31] Schank, T., Wagner, D. (2005). Finding, counting and listing all triangles in large graphs, an experimental study. In: International workshop on experimental and efficient algorithms (p. 606-609). Springer, Berlin, Heidelberg.
[32] Kwak, Haewoon., Lee, Changhyun., Park, Hosung., Moon, Sue. (2010). What is Twitter, a social network or a news media? International World Wide Web Conference (WWW), 2010.
[33] Mislove, Alan., Marcon, Massimiliano., Gummadi, Krishna P., Druschel, Peter., Bhattacharjee, Bobby. (2007). Measurement and analysis of online social networks. Conference on Internet Measurement (IMC), 2007.
[34] Sinha, Arnab., Shen, Zhihong., Song, Yang., Ma, Hao., Eide, Darrin., Wang, Kuansan. (2015). An overview of Microsoft academic service (MAS) and applications. World Wide Web Consortium (W3C), 2015.
[35] Leskovec, J., Lang, K. J., Dasgupta, A., Mahoney, M. W. (2009). Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6 (1) 29-123.
[36] Castillo, C., Donato, D., Gionis, A., Murdock, V., Silvestri, F. (2007). Know your neighbors: Web spam detection using the web topology. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and development in information retrieval (p. 423-430). ACM.
[37] Leskovec, J., Mcauley, J. J. (2012). Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems (p. 539-547).
[38] Edunov, S., Logothetis, D., Wang, C., Ching, A., Kabiljo, M. (2016). Darwini: Generating realistic large-scale social graphs. arXiv preprint arXiv:1610.00664.
[39] Ammar, K., Ozsu, T. (2018). Experimental Analysis of Distributed Graph Systems. arXiv preprint arXiv:1806.08082.
[40] Hindman, B., Konwinski, A., Zaharia, M., Ghodsi, A., Joseph, A. D., Katz, R. H., Stoica, I. (2011, March). Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center. In: NSDI (Vol. 11, No. 2011, p. 22-22).
[41] Minyang Han, Khuzaima Daudjee, Khaled Ammar, MTamerO zsu,XingfangWang,andTianqiJin.An experimental comparison of pregel-like graph processing systems. PVLDB, 7 (12) 1047–1058, 2014.
[42] Dai, J. (2015). Experience and lessons learned for large-scale graph analysis using GraphX. Spark Summit East.
[43] Dave, A., Jindal, A., Li, L. E., Xin, R., Gonzalez, J., Zaharia, M. (2016, June). Graphframes: an integrated api for mixing graph and relational queries. In: Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems (p. 2). ACM.
[44] Lu, Yi., Cheng, James., YanM Da., Wu, Huanhuan. (2014). Large-scale distributed graph computing systems: An experimental evaluation. PVLDB, 8 (3) 281–292, 2014.
[45] Zaharia, M., Xin, R. S., Wendell, P., Das, T., Armbrust, M., Dave, A., Ghodsi, A. (2016). Apache spark: a unified engine for big data processing. Communications of the ACM, 59 (11) 56-65.
[46] Iosup, Alexandru., Hegeman, Wing Lung., Ngai, Wing Lung., Heldens, Stijn., Prat-Pìerez, Arnau., Manhardto, Thomas., Chafio, Capota,Hassan., Mihai,. Sundaram, Narayanan., Anderson, Michael. (2016). LDBC graphalytics: A benchmark for largescale
graph analysis on parallel and distributed platforms. PVLDB, 9 (13) 1317–1328. |
