{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:45:39Z","timestamp":1725907539817},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319654812"},{"type":"electronic","value":"9783319654829"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-65482-9_11","type":"book-chapter","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T14:08:09Z","timestamp":1502374089000},"page":"165-179","source":"Crossref","is-referenced-by-count":0,"title":["A Topology-Aware Framework for Graph Traversals"],"prefix":"10.1007","author":[{"given":"Jia","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huashan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,11]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1137\/S0097539796303421","volume":"28","author":"D Aingworth","year":"1996","unstructured":"Aingworth, D., Chekuri, C., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28(4), 1167\u20131181 (1996)","journal-title":"SIAM J. Comput."},{"issue":"C","key":"11_CR2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.tcs.2015.02.033","volume":"586","author":"M Borassi","year":"2015","unstructured":"Borassi, M., Crescenzi, P., Habib, M., Kosters, W.A., Marino, A., Takes, F.W.: Fast diameter and radius bfs-based computation in (weakly connected) real-world graphs. Theor. Comput. Sci. 586(C), 59\u201380 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20137","key":"11_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. ISDN Syst. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Chechik, S., Larkin, D.H., Roditty, L., Schoenebeck, G., Tarjan, R.E., Williams, V.V.: Better approximation algorithms for the graph diameter. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp. 1041\u20131052. Society for Industrial and Applied Mathematics, Philadelphia (2014)","DOI":"10.1137\/1.9781611973402.78"},{"issue":"12","key":"11_CR5","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.14778\/2824032.2824077","volume":"8","author":"A Ching","year":"2015","unstructured":"Ching, A., Edunov, S., Kabiljo, M., Logothetis, D., Muthukrishnan, S.: One trillion edges: Graph processing at facebook-scale. Proc. VLDB Endow. 8(12), 1804\u20131815 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-30850-5_10","volume-title":"Experimental Algorithms","author":"P Crescenzi","year":"2012","unstructured":"Crescenzi, P., Grossi, R., Lanzi, L., Marino, A.: On computing the diameter of real-world directed (weighted) graphs. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 99\u2013110. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-30850-5_10"},{"key":"11_CR7","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, pp. 17\u201330. USENIX Association, Berkeley (2012)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Kusum, A., Vora, K., Gupta, R., Neamtiu, I.: Efficient processing of large graphs via input reduction. In: Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing, pp. 245\u2013257. ACM, New York (2016)","DOI":"10.1145\/2907294.2907312"},{"issue":"8","key":"11_CR9","doi-asserted-by":"crossref","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."},{"issue":"3","key":"11_CR10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.14778\/2735508.2735517","volume":"8","author":"Y Lu","year":"2014","unstructured":"Lu, Y., Cheng, J., Yan, D., Wu, H.: Large-scale distributed graph computing systems: an experimental evaluation. Proc. VLDB Endow. 8(3), 281\u2013292 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146. ACM, New York (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Nai, L., Xia, Y., Tanase, I.G., Kim, H., Lin, C.Y.: GraphBIG: understanding graph computing in the context of industrial solutions. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, p. 69. ACM, New York (2015)","DOI":"10.1145\/2807591.2807626"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Salihoglu, S., Widom, J.: GPS: A graph processing system. In: Proceedings of the 25th International Conference on Scientific and Statistical Database Management, p. 22. ACM, New York (2013)","DOI":"10.1145\/2484838.2484843"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Shun, J.: An evaluation of parallel eccentricity estimation algorithms on undirected real-world graphs. In: Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1095\u20131104. ACM, New York (2015)","DOI":"10.1145\/2783258.2783333"},{"issue":"8","key":"11_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/2517327.2442530","volume":"48","author":"J Shun","year":"2013","unstructured":"Shun, J., Blelloch, G.E.: Ligra: A lightweight graph processing framework for shared memory. ACM Sigplan Not. 48(8), 135\u2013146 (2013)","journal-title":"ACM Sigplan Not."},{"key":"11_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84800-070-4","volume-title":"The Algorithm Design Manual","author":"BS Skeina","year":"2008","unstructured":"Skeina, B.S.: The Algorithm Design Manual, 2nd edn. Springer, Heidelbergz (2008)","edition":"2"},{"issue":"3","key":"11_CR17","doi-asserted-by":"crossref","first-page":"193","DOI":"10.14778\/2732232.2732238","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Balmin, A., Corsten, S.A., Tatikonda, S., Mcpherson, J.: From think like a vertex to think like a graph. Proc. VLDB Endow. 7(3), 193\u2013204 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Xin, R.S., Gonzalez, J.E., Franklin, M.J., Stoica, I.: GraphX: a resilient distributed graph system on Spark. In: First International Workshop on Graph Data Management Experiences and Systems, p. 2. ACM, New York (2013)","DOI":"10.1145\/2484425.2484427"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Effective techniques for message reduction and load balancing in distributed graph computation. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1307\u20131317. ACM, New York (2015)","DOI":"10.1145\/2736277.2741096"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, K., Chen, R., Chen, H.: NUMA-aware graph-structured analytics. In: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 183\u2013193. ACM, New York (2015)","DOI":"10.1145\/2688500.2688507"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Liu, L., Lee, K., Pu, C., Zhang, Q.: Fast iterative graph computation with resource aware graph parallel abstractions. In: Proceedings of the 24th ACM International Symposium on High-Performance Parallel and Distributed Computing, pp. 179\u2013190. ACM, New York (2015)","DOI":"10.1145\/2749246.2749258"}],"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-65482-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T14:12:06Z","timestamp":1502374326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-65482-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319654812","9783319654829"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65482-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}