{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:07:34Z","timestamp":1750910854448,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319670737"},{"type":"electronic","value":"9783319670744"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67074-4_15","type":"book-chapter","created":{"date-parts":[[2017,9,6]],"date-time":"2017-09-06T23:01:15Z","timestamp":1504738875000},"page":"148-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Parallel Method for Performing Concurrent Operations on Social Networks"],"prefix":"10.1007","author":[{"given":"Phuong-Hanh","family":"Du","sequence":"first","affiliation":[]},{"given":"Hai-Dang","family":"Pham","sequence":"additional","affiliation":[]},{"given":"Ngoc-Hoa","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,7]]},"reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.trit.2016.03.011","volume":"1","author":"M Gong","year":"2016","unstructured":"Gong, M., Li, G., Wang, Z., Ma, L., Tian, D.: An efficient shortest path approach for social networks based on community structure. CAAI Trans. Intell. Technol. 1(1), 114\u2013123 (2016)","journal-title":"CAAI Trans. Intell. Technol."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Du, P.-H., Pham, H.-D., Nguyen, N.-H.: Optimizing the shortest path query on large-scale dynamic directed graph. In: The 3rd IEEE\/ACM International Conference on Big Data Computing, Applications and Technologies, pp. 210\u2013216 (2016)","DOI":"10.1145\/3006299.3006321"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Wei, J., Chen, K., Zhou, Y., Zhou, Q., He, J.: Benchmarking of distributed computing engines spark and graphlab for big data analytics. In: International Conference on Big Data Computing Service and Applications, pp. 10\u201313 (2016)","DOI":"10.1109\/BigDataService.2016.11"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Hallac, D., Leskovec, J., Boyd, S.: Network lasso: clustering and optimization in large graphs. In: ACM SIGKDD International Conference on KDD, pp. 387\u2013396 (2015)","DOI":"10.1145\/2783258.2783313"},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1109\/TKDE.2013.176","volume":"26","author":"Leong Hou U","year":"2014","unstructured":"U, L.H., Zhao, H.J., Yiu, M.L., Li, Y., Gong, Z.: Towards online shortest path computation. IEEE Trans. Knowl. Data Eng. 26(4), 1012\u20131025 (2014)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Chakaravarthy, V.T., Checconi, F., Petrini, F., Sabharwal, Y.: Scalable single source shortest path algorithms for massively parallel systems. In: IEEE 28th International Parallel and Distributed Processing Symposium, pp. 889\u2013901 (2014)","DOI":"10.1109\/IPDPS.2014.96"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Mondal, J., Deshpande, A.: Managing large dynamic graphs efficiently. In: Proceedings of the ACM SIGMOD 2012, pp. 145\u2013156 (2012)","DOI":"10.1145\/2213836.2213854"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"710","DOI":"10.14778\/1453856.1453934","volume":"1","author":"SA Yahia","year":"2008","unstructured":"Yahia, S.A., Benedikt, M., Lakshmanan, L., Stoyanovich, J.: Efficient network aware search in collaborative tagging sites. Proc. VLDB Endow. 1(1), 710\u2013721 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E., Schardl, T.B.: A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). In: Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 303\u2013314 (2010)","DOI":"10.1145\/1810479.1810534"},{"key":"15_CR10","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: 10th USENIX Symposium on Operating Systems Design and Implementation, pp. 17\u201330 (2012)"},{"key":"15_CR11","unstructured":"Gonzalez, J.E., Xin, R.S., Dave, A., Crankshaw, D., Franklin, M.J., Stoica, I.: GraphX: graph processing in a distributed dataflow framework. In: 11th USENIX Conference on Operating Systems Design and Implementation, pp. 599\u2013613 (2014)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swar, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference, pp. 11\u201315 (2008)","DOI":"10.25080\/TCWV9851"},{"key":"15_CR13","unstructured":"The ACM SIGMOD Programming Contest 2016: http:\/\/dsg.uwaterloo.ca\/sigmod16contest\/. Accessed 15 May 2017"},{"key":"15_CR14","unstructured":"H_minor_free: http:\/\/dsg.uwaterloo.ca\/sigmod16contest\/downloads\/H_minor_free-poster.pdf. Accessed 15 May 2017"},{"key":"15_CR15","unstructured":"Stanford Large Network Dataset Collection: https:\/\/snap.stanford.edu\/data\/index.html. Accessed 15 May 2017"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67074-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T16:24:49Z","timestamp":1750868689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-67074-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319670737","9783319670744"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67074-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"7 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}