{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:35:21Z","timestamp":1725744921405},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_11","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"121-132","source":"Crossref","is-referenced-by-count":0,"title":["An Implementation of I\/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Beckmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Veith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"11_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":"11_CR2","unstructured":"Ajwani, D.: Traversing large graphs in realistic setting. PhD thesis, Saarland University (2008)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Ajwani, D., Meyer, U.: Design and engineering of external memory traversal algorithms for general graphs. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics. LNCS, vol.\u00a05515, pp. 1\u201333. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02094-0_1"},{"key":"11_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"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-003-1021-x","volume":"37","author":"L. Arge","year":"2003","unstructured":"Arge, L.: The buffer tree: A technique for designing batched external data structures. Algorithmica\u00a037(1), 1\u201324 (2003)","journal-title":"Algorithmica"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.jalgor.2004.04.001","volume":"53","author":"L. Arge","year":"2004","unstructured":"Arge, L., Brodal, G., Toma, L.: On external-memory MST, SSSP and multi-way planar graph separation. J. Algorithms\u00a053(2), 186\u2013206 (2004)","journal-title":"J. Algorithms"},{"issue":"30","key":"11_CR7","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0022-0000(84)90003-5","volume":"29","author":"M. Atallah","year":"1984","unstructured":"Atallah, M., Vishkin, U.: Finding euler tours in parallel. Journal of Computer and System Sciences\u00a029(30), 330\u2013337 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR8","unstructured":"Chiang, Y.J., Goodrich, M.T., Grove, E.F., Tamasia, R., Vengroff, D.E., Vitter, J.S.: External memory graph algorithms. In: Proceedings of the 6th Annual Symposium on Discrete Algorithms (SODA), pp. 139\u2013149. ACM-SIAM (1995)"},{"key":"11_CR9","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 \u2013 experimentally turning a lower bound into an upper bound. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 302\u2013313. Springer, Heidelberg (2010)"},{"key":"11_CR10","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\/777412.777435"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Galil, Z., Italiano, G.: Dynamic graph algorithms. In: Atallah, M.J. (ed.) Algorithms and Theory of Computation Handbook, ch. 8. CRC Press (1999)","DOI":"10.1201\/9781420049503-c9"},{"key":"11_CR12","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":"11_CR13","unstructured":"Meyer, U.: On dynamic Breadth-First Search in external-memory. In: 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 551\u2013560 (2008)"},{"key":"11_CR14","unstructured":"Munagala, K., Ranade, A.: I\/O-complexity of graph algorithms. In: Proceedings of the 10th Annual Symposium on Discrete Algorithms (SODA), pp. 687\u2013694. ACM-SIAM (1999)"},{"key":"11_CR15","unstructured":"Roditty, L.: Dynamic and static algorithms for path problems in graphs. PhD thesis, Tel Aviv University (2006)"},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1561\/0400000014","volume":"2","author":"J.S. Vitter","year":"2006","unstructured":"Vitter, J.S.: Algorithms and data structures for external memory. Foundations and Trends in Theoretical Computer Science\u00a02(4), 305\u2013474 (2006)","journal-title":"Foundations and Trends in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T22:45:05Z","timestamp":1563662705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}