{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:11Z","timestamp":1775282291355,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1007\/bf01940646","type":"journal-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T10:52:21Z","timestamp":1123066341000},"page":"181-214","source":"Crossref","is-referenced-by-count":31,"title":["Blocking for external graph searching"],"prefix":"10.1007","volume":"16","author":[{"given":"M. H.","family":"Nodine","sequence":"first","affiliation":[]},{"given":"M. T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"J. S.","family":"Vitter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01940646_CR1","volume-title":"The Art of Computer Programming, Vol. 3","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973."},{"key":"BF01940646_CR2","doi-asserted-by":"crossref","unstructured":"A. Aggarawal and J. Park, Notes on Searching in Multidimensional Monotone Arrays,Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, White Plains, NY, October 1988, pp. 497\u2013512.","DOI":"10.1109\/SFCS.1988.21966"},{"key":"BF01940646_CR3","volume-title":"Principles of Database and Knowledge-Base Systems","author":"J. D. Ullman","year":"1988","unstructured":"J. D. Ullman,Principles of Database and Knowledge-Base Systems, Computer Science Press, Rockville, MD, 1988."},{"key":"BF01940646_CR4","doi-asserted-by":"crossref","unstructured":"A. Borodin, S. Irani, P. Raghavan, and B. Schieber, Competitive Paging with Locality of Reference,Proceedings of the 23rd ACM Symposium on Theory of Computing, New Orleans, LA, May 1991, pp. 249\u2013259.","DOI":"10.1145\/103418.103422"},{"key":"BF01940646_CR5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01530929","volume":"3","author":"J. D. Ullman","year":"1991","unstructured":"J. D. Ullman and M. Yannakakis, The Input\/Output Complexity of Transitive Closure,Ann. Math. Artificial Intel. 3 (1991), 331\u2013360.","journal-title":"Ann. Math. Artificial Intel."},{"key":"BF01940646_CR6","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/0204038","volume":"4","author":"A. L. Rosenberg","year":"1975","unstructured":"A. L. Rosenberg, Preserving Proximity in Arrays,SIAM J. Comput. 4 (1975), 443\u2013460.","journal-title":"SIAM J. Comput."},{"key":"BF01940646_CR7","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/359361.359447","volume":"21","author":"R. A. Millo De","year":"1978","unstructured":"R. A. DeMillo, S. C. Eisenstat, and R. J. Lipton, Preserving Average Proximity in Arrays,Comm. ACM 21 (1978), 228\u2013231.","journal-title":"Comm. ACM"},{"key":"BF01940646_CR8","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/322154.322160","volume":"26","author":"A. L. Rosenberg","year":"1979","unstructured":"A. L. Rosenberg, Encoding Data Structures in Trees,J. Assoc. Comput. Mach. 26 (1979), 668\u2013689.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01940646_CR9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00288886","volume":"9","author":"A. L. Rosenberg","year":"1978","unstructured":"A. L. Rosenberg, Data Encodings and Their Costs,Acta Inform. 9 (1978), 273\u2013292.","journal-title":"Acta Inform."},{"key":"BF01940646_CR10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01776564","volume":"12","author":"A. L. Rosenberg","year":"1978","unstructured":"A. L. Rosenberg and L. Snyder, Bounds on the Costs of Data Encodings,Math. Systems Theory 12 (1978), 9\u201339.","journal-title":"Math. Systems Theory"},{"key":"BF01940646_CR11","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1137\/0604055","volume":"4","author":"F. R. K. Chung","year":"1983","unstructured":"F. R. K. Chung, A. L. Rosenberg, and L. Snyder, Perfect Storage Representations for Families of Data Structures,SIAM J. Algebraic Discrete Methods 4 (1983), 548\u2013565.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF01940646_CR12","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1982.1676109","volume":"31","author":"R. Aleliunas","year":"1982","unstructured":"R. Aleliunas and A. L. Rosenberg, On Embedding Rectangular Grids in Square Grids,IEEE Trans. Comput. 31 (1982), 907\u2013913.","journal-title":"IEEE Trans. Comput."},{"key":"BF01940646_CR13","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/321978.321990","volume":"23","author":"R. J. Lipton","year":"1976","unstructured":"R. J. Lipton, S. C. Eisenstat, and R. A. DeMillo, Space and Time Hierarchies for Classes of Control Structures and Data Structures,J. Assoc. Comput. Mach. 23 (1976), 720\u2013732.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01940646_CR14","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1976","unstructured":"C. Berge,Graphs and Hypergraphs, 2nd edn., North-Holland, Amsterdam, 1976.","edition":"2nd edn."},{"key":"BF01940646_CR15","series-title":"Lecture Notes in Computer Science, Vol. 411","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-52292-1_14","volume-title":"Graph-Theoretic Concepts in Computer Science: Proceedings of the 15th International Workshop WG '89","author":"G. Reich","year":"1990","unstructured":"G. Reich and P. Widmayer, Beyond Steiner's Problem: A VSLI Oriented Generalization, inGraph-Theoretic Concepts in Computer Science: Proceedings of the 15th International Workshop WG '89 (G. Goos and J. Hartmanis, eds.), Lecture Notes in Computer Science, Vol. 411, Springer-Verlag, Berlin, 1990, pp. 196\u2013210."},{"key":"BF01940646_CR16","series-title":"Lecture Notes in Computer Science, Vol. 484","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-53832-1_36","volume-title":"Graph-Theoretic Concepts in Computer Science, Proceedings of the 16th International Workshop WG '90","author":"E. Ihler","year":"1991","unstructured":"E. Ihler, Bounds on the Quality of Approximate Solutions to the Group Steiner Problem, inGraph-Theoretic Concepts in Computer Science, Proceedings of the 16th International Workshop WG '90 (G. Goos and J. Hartmanis, eds.), Lecture Notes in Computer Science, Vol. 484, Springer-Verlag, Berlin, 1991, pp. 109\u2013118."},{"key":"BF01940646_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940646.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01940646\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:23:25Z","timestamp":1557750205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01940646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["BF01940646"],"URL":"https:\/\/doi.org\/10.1007\/bf01940646","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}