{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:10:47Z","timestamp":1748751047584,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271217"},{"type":"electronic","value":"9783319271224"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27122-4_36","type":"book-chapter","created":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T11:27:27Z","timestamp":1447673247000},"page":"525-539","source":"Crossref","is-referenced-by-count":0,"title":["Solving Large Graph Problems in MapReduce-Like Frameworks via Optimized Parameter Configuration"],"prefix":"10.1007","author":[{"given":"Huanle","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronghai","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhibo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing Cheong","family":"Lau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,16]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Nikolov, A., Onak, K., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: Proceeding of STOC, pp. 574\u2013583 (2014)","DOI":"10.1145\/2591796.2591805"},{"key":"36_CR2","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of OSDI, pp. 137\u2013150, December 2004"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Dehne, F., Gotz, S.: Practical parallel algorithms for minimum spanning trees. In: Proceedings of Seventeenth IEEE Symposium on Reliable Distributed Systems, pp. 366\u2013371, October 1998","DOI":"10.1109\/RELDIS.1998.740525"},{"key":"36_CR4","unstructured":"Israel, A., Itai, A.: A fast and simple randomized parallel algorithm for maximal matching. Inf. Process. Lett. (2012). abs\/12035387"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: Proceedings of SODA, pp. 938\u2013948 (2010)","DOI":"10.1137\/1.9781611973075.76"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T., Seshadhri, C., Task, C.: Counting triangles in massive graphs with MapReduce. arXiv:1301.5887v3 (2013)","DOI":"10.1137\/13090729X"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7, 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Kumar, R., Moseley, B., Vassilvitskii, S., Vattani, A.: Fast greedy algorithms in MapReduce and streaming. In: Proceeding of SPAA, pp. 1\u201310 (2013)","DOI":"10.1145\/2486159.2486168"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Lattanzi, S., Moseley, B., Suri, S.: Fitering: a method for solving graph problems in MapReduce. In: SPAA, June 2010","DOI":"10.1145\/1989493.1989505"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD (2005)","DOI":"10.1145\/1081870.1081893"},{"issue":"8","key":"36_CR11","doi-asserted-by":"publisher","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endow. 5(8), 716\u2013727 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"36_CR13","unstructured":"Moussa, M.I.: A new parallel algorithm for computing MINIMUM SPANNING TREE. Int. J. Soft Comput. Math. Control 2(2) (2013)"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Qin, L., Yu, J.X., Chang, L., Cheng, H., Zhang, C., Lin, X.: Scalable big graph processing in MapReduce. In: Proceeding of SIGMOD, pp. 827\u2013838, June 2014","DOI":"10.1145\/2588555.2593661"},{"issue":"2","key":"36_CR15","first-page":"77","volume":"22","author":"V Rastogi","year":"1986","unstructured":"Rastogi, V., Machanavajjhala, A., Chitnis, L., Sarma, A.: Finding connected components in Map-Reduce in logarithmic rounds. Comput. Res. Repository (CoRR) 22(2), 77\u201380 (1986)","journal-title":"Comput. Res. Repository (CoRR)"},{"key":"36_CR16","unstructured":"Spangler, T.: Algorithms for grid graph in MapReduce model. Thesis of master, December 2013"},{"key":"36_CR17","unstructured":"Xiang, J., Guo, C., Aboulnaga, A.: Scalable maximum clique computation using MapReduce. In: International Conference on Data Engineering, April 2013"},{"key":"36_CR18","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng., W.: Practical Pregel algorithms for massive graphs. Technical report, September 2013"},{"key":"36_CR19","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauley, M., Franklin, M.J., Shenker, S., Stoica, I.: Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: NSDI (2012)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27122-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T12:05:00Z","timestamp":1748693100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27122-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271217","9783319271224"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27122-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}