{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:43:46Z","timestamp":1752551026199},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648482"},{"type":"electronic","value":"9783540685302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68530-8_28","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T22:14:16Z","timestamp":1194560056000},"page":"332-343","source":"Crossref","is-referenced-by-count":37,"title":["A Functional Approach to External Graph Algorithms"],"prefix":"10.1007","author":[{"given":"James","family":"Abello","sequence":"first","affiliation":[]},{"given":"Adam L.","family":"Buchsbaum","sequence":"additional","affiliation":[]},{"given":"Jeffery R.","family":"Westbrook","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"issue":"8","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal and J. S. Vitter. The input\/output complexity of sorting and related problems. C. ACM, 31(8):1116\u201327, 1988.","journal-title":"C. ACM"},{"key":"28_CR2","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"28_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/3-540-60220-8_74","volume-title":"Proc. 4th WADS","author":"L. Arge","year":"1995","unstructured":"L. Arge. The buffer tree: A new technique for optimal I\/O algorithms. In Proc. 4th WADS, volume 955 of LNCS, pages 334\u201345. Springer-Verlag, 1995."},{"key":"28_CR4","first-page":"37","volume":"3","author":"O. Bor\u016fvka","year":"1926","unstructured":"O. Bor\u016fvka. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u2019m. Pr\u00e1ceMor. Pr\u2019rodoved. Spol. v Brne, 3:37\u201358, 1926.","journal-title":"Pr\u00e1ceMor. Pr\u2019rodoved. Spol. v Brne"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","volume":"7","author":"P. M. Camerini","year":"1978","unstructured":"P. M. Camerini. The min-max spanning tree problem and some extensions. IPL, 7:10\u20134, 1978.","journal-title":"IPL"},{"key":"28_CR6","first-page":"143","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N.Wegman. Universal classes of hash functions. JCSS, 18:143\u201354, 1979.","journal-title":"JCSS"},{"key":"28_CR7","unstructured":"Y.-J. Chiang. Dynamic and I\/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results. PhD thesis, Dept. of Comp. Sci., Brown Univ., 1995."},{"key":"28_CR8","unstructured":"Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. 6th ACM-SIAM SODA, pages 139\u201349, 1995."},{"issue":"9","key":"28_CR9","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1145\/358628.358650","volume":"25","author":"F. Y. Chin","year":"1982","unstructured":"F. Y. Chin, J. Lam, and I.-N. Chen. Efficient parallel algorithms for some graph problems. C. ACM, 25(9):659\u201365, 1982.","journal-title":"C. ACM"},{"issue":"1","key":"28_CR10","first-page":"86","volume":"38","author":"J. R. Driscoll","year":"1989","unstructured":"J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. JCSS, 38(1):86\u2013124, February 1989.","journal-title":"JCSS"},{"key":"28_CR11","unstructured":"J. Ja\u2019Ja. An Introduction to Parallel Algorithms. Addison-Wesley, 1992."},{"issue":"2","key":"28_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/201019.201022","volume":"42","author":"D. R. Karger","year":"1995","unstructured":"D. R. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. J. ACM, 42(2):321\u201328, 1995.","journal-title":"J. ACM"},{"issue":"6","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1145\/195613.195632","volume":"41","author":"R. M. Karp","year":"1994","unstructured":"R. M. Karp. Probabilistic recurrence relations. J. ACM, 41(6):1136\u201350, 1994.","journal-title":"J. ACM"},{"issue":"4","key":"28_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0020-0190(94)90130-9","volume":"52","author":"P. Kelsen","year":"1994","unstructured":"P. Kelsen. An optimal parallel algorithm for maximal matching. IPL, 52(4):223\u20138, 1994.","journal-title":"IPL"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proc. 8th IEEE SPDP, pages 169\u201376, 1996.","DOI":"10.1109\/SPDP.1996.570330"},{"key":"28_CR16","unstructured":"M. J. Litzkow and M. Livny. Making workstations a friendly environment for batch jobs. In Proc. 3rd Wks. on Work. Oper. Sys., April 1992."},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comp., 15:1036\u201353, 1986.","journal-title":"SIAM J. Comp."},{"key":"28_CR18","unstructured":"K. Mehlhorn. Personal communication. http:\/\/www.mpi-sb.mpg.de\/ crauser-\/courses.html, 1998."},{"key":"28_CR19","unstructured":"J. S. Plank, M. Beck, G. Kingsley, and K. Li. Libckpt: Transparent checkpointing under UNIX. In Proc. Usenix Winter 1995 Tech. Conf., pages 213\u201323, 1995."},{"issue":"3","key":"28_CR20","first-page":"362","volume":"26","author":"D. D. Sleator","year":"1983","unstructured":"D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. JCSS, 26(3):362\u201391, 1983.","journal-title":"JCSS"},{"issue":"2","key":"28_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R. E. Tarjan","year":"1984","unstructured":"R. E. Tarjan and J. van Leeuwen. Worst-case analysis of set union algorithms. J. ACM, 31(2):245\u201381, 1984.","journal-title":"J. ACM"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. Wadler","year":"1990","unstructured":"P. Wadler. Deforestation: Transforming programs to eliminate trees. Theor. Comp. Sci., 73:231\u201348, 1990.","journal-title":"Theor. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA\u2019 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68530-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T02:28:54Z","timestamp":1551061734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68530-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648482","9783540685302"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-68530-8_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}