{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:11Z","timestamp":1725701651750},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_8","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:29:11Z","timestamp":1346153351000},"page":"72-83","source":"Crossref","is-referenced-by-count":2,"title":["I\/O-efficient Hierarchical Diameter Approximation"],"prefix":"10.1007","author":[{"given":"Deepak","family":"Ajwani","sequence":"first","affiliation":[]},{"given":"Ulrich","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"David","family":"Veith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Communications of the ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"key":"8_CR2","unstructured":"Ajwani, D.: Traversing large graphs in realistic setting. PhD thesis, Saarland University (2008)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Ajwani, D., Beckmann, A., Meyer, U., Veith, D.: I\/O-efficient approximation of graph diameters by parallel cluster growing \u2013 A first experimental study. In: 10th Workshop on Parallel Systems and Algorithms, PASA (2012)","DOI":"10.1007\/BF03342028"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Ajwani, D., Meyer, U., Osipov, V.: Improved external memory BFS implementation. In: Proc. 9th ALENEX, pp. 3\u201312 (2007)","DOI":"10.1137\/1.9781611972870.1"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-27836-8_15","volume-title":"Automata, Languages and Programming","author":"L. Arge","year":"2004","unstructured":"Arge, L., Meyer, U., Toma, L.: External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 146\u2013157. Springer, Heidelberg (2004)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: Snap, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks. In: Proc. 22nd IPDPS, pp. 1\u201312. IEEE (2008)","DOI":"10.1109\/IPDPS.2008.4536261"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11764298_9","volume-title":"Experimental Algorithms","author":"K. Boitmanis","year":"2006","unstructured":"Boitmanis, K., Freivalds, K., Ledi\u0146\u0161, P., Opmanis, R.: Fast and Simple Approximation of the Diameter and Radius of a Graph. In: \u00c0lvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol.\u00a04007, pp. 98\u2013108. Springer, Heidelberg (2006)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Network Analysis: Methodological Foundations","year":"2005","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol.\u00a03418. Springer, Heidelberg (2005)"},{"key":"8_CR9","unstructured":"Chowdury, R., Ramachandran, V.: External-memory exact and approximate all-pairs shortest-paths in undirected graphs. In: Proc. 16th SODA, pp. 735\u2013744. ACM-SIAM (2005)"},{"issue":"2-3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(00)00281-X","volume":"113","author":"D.G. Corneil","year":"2001","unstructured":"Corneil, D.G., Dragan, F.F., Habib, M., Paul, C.: Diameter determination on restricted graph families. Discrete Applied Mathematics\u00a0113(2-3), 143\u2013166 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-15775-2_26","volume-title":"Algorithms \u2013 ESA 2010","author":"P. Crescenzi","year":"2010","unstructured":"Crescenzi, P., Grossi, R., Imbrenda, C., Lanzi, L., Marino, A.: Finding the Diameter in Real-World Graphs. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 302\u2013313. Springer, Heidelberg (2010)"},{"key":"8_CR12","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.\u00a07276, pp. 99\u2013110. Springer, Heidelberg (2012)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Dementiev, R., Sanders, P.: Asynchronous parallel disk sorting. In: Proc. 15th SPAA, pp. 138\u2013148. ACM (2003)","DOI":"10.1145\/777432.777435"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-642-23719-5_56","volume-title":"Algorithms \u2013 ESA 2011","author":"M.T. Goodrich","year":"2011","unstructured":"Goodrich, M.T., Pszona, P.: External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 664\u2013676. Springer, Heidelberg (2011)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1412228.1455266","volume":"13","author":"C. Magnien","year":"2009","unstructured":"Magnien, C., Latapy, M., Habib, M.: Fast computation of empirically tight bounds for the diameter of massive graphs. Journal of Experimental Algorithmics\u00a013, 1.10\u20131.9 (2009)","journal-title":"Journal of Experimental Algorithmics"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/3-540-45749-6_63","volume-title":"Algorithms - ESA 2002","author":"K. Mehlhorn","year":"2002","unstructured":"Mehlhorn, K., Meyer, U.: External-Memory Breadth-First Search with Sublinear I\/O. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 723\u2013735. Springer, Heidelberg (2002)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-69903-3_38","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"U. Meyer","year":"2008","unstructured":"Meyer, U.: On Trade-Offs in External-Memory Diameter-Approximation. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 426\u2013436. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:55:10Z","timestamp":1620114910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}