{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:33:11Z","timestamp":1725456791313},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615491"},{"type":"electronic","value":"9783540688082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0030119","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:38:48Z","timestamp":1133415528000},"page":"287-298","source":"Crossref","is-referenced-by-count":10,"title":["Efficient dynamic embedding of arbitrary binary trees into hypercubes"],"prefix":"10.1007","author":[{"given":"Volker","family":"Heun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst W.","family":"Mayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"26_CR1","unstructured":"S. Bezrukov, B. Monien, W. Unger, G. Wechsung: Embedding Ladders and Caterpillars into the Hypercube, Preprint, GH-Univ. Paderborn, 1993, to appear in Disc. Appl. Math.."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/174130.174144","volume":"40","author":"S. Bhatt","year":"1993","unstructured":"S. Bhatt, J.-Y. Cai: Taking Random Walks to Grow Trees in Hypercubes, J. ACM, 40(1993) 741\u2013764.","journal-title":"J. ACM"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/0221012","volume":"21","author":"S. Bhatt","year":"1992","unstructured":"S. Bhatt, F. Chung, T. Leighton, A. Rosenberg: Efficient Embeddings of Trees in Hypercubes, SIAM J. Comput., 21(1992), 151\u2013162.","journal-title":"SIAM J. Comput."},{"key":"26_CR4","unstructured":"S. Bhatt, I. Ipsen: How to embed trees in hypercubes, Yale University Research Report RR-443, 1985."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"M.Y. Chan: Embedding of d-Dimensional Grids into Optimal Hypercubes, Proc. of the 1989 Symp. on Parallel Algorithms and Architectures, 52\u201357.","DOI":"10.1145\/72935.72941"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1137\/0220052","volume":"20","author":"M.Y. Chan","year":"1991","unstructured":"M.Y. Chan: Embedding of Grids into Optimal Hypercubes, SIAM J. Comput., 20(1991), 834\u2013864.","journal-title":"SIAM J. Comput."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1006\/jpdc.1996.0029","volume":"33","author":"M. Chan","year":"1996","unstructured":"M. Chan, F. Chin, C. Chu, W. Mak: Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes, J. Parallel Distrib. Comput., 33(1996), 98\u2013106.","journal-title":"J. Parallel Distrib. Comput."},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/0743-7315(91)90046-C","volume":"11","author":"K. Efe","year":"1991","unstructured":"K. Efe: Embedding Mesh of Trees in the Hypercube, J. Parallel Distrib. Comput., 11(1991), 222\u2013230.","journal-title":"J. Parallel Distrib. Comput."},{"key":"26_CR9","unstructured":"T. Feder, E. Mayr: An Efficient Algorithm for Embedding Complete Binary Trees in the Hypercube, Stanford University, 1987."},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.21136\/CPM.1984.108506","volume":"109","author":"I. Havel","year":"1984","unstructured":"I. Havel: On Hamiltonian Circuits and Spanning Trees of Hypercubes (in Czech.), \u010casopis. P\u011bst. Mat., 109(1984), 145\u2013152.","journal-title":"\u010casopis. P\u011bst. Mat."},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.21136\/CPM.1973.117800","volume":"98","author":"I. Havel","year":"1973","unstructured":"I. Havel, P. Liebl: Embedding the Polytomic Tree into the n-Cube, \u010casopis. P\u011bst. Mat., 98(1973), 307\u2013314.","journal-title":"\u010casopis. P\u011bst. Mat."},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.3190100110","volume":"10","author":"I. Havel","year":"1986","unstructured":"I. Havel, P. Liebl: One-Legged Caterpillars Span Hypercubes, J. Graph Theory, 10 (1986), 69\u201376.","journal-title":"J. Graph Theory"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1006\/jagm.1996.0018","volume":"20","author":"V. Heun","year":"1996","unstructured":"V. Heun, E. Mayr: A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube, J. Algorithms, 20(1996), 375\u2013199.","journal-title":"J. Algorithms"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"V. Heun, E. Mayr: Embedding Graphs with Bounded Treewidth into Optimal Hypercubes, Proc. of the 13th Symp. on Theoretical Aspects of Computer Science, LNCS 1046, 157\u2013168.","DOI":"10.1007\/3-540-60922-9_14"},{"key":"26_CR15","unstructured":"V. Heun, E. Mayr: Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes, (to appear in Proc. of the 4th Workshop on Parallel Systems and Algorithms)."},{"key":"26_CR16","unstructured":"V. Heun, E. Mayr: A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes, (to appear in Proc. of the Euro-Par'96)."},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1137\/0221039","volume":"21","author":"T. Leighton","year":"1992","unstructured":"T. Leighton, M. Newman, A. Ranade, W. Schwabe: Dynamic Tree Embeddings in Butterflies and Hypercubes, SIAM J. Comput., 21(1992), 639\u2013654.","journal-title":"SIAM J. Comput."},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"B. Monien, H. Sudborough: Simulating Binary Trees on Hypercubes, Proc. of the 3rd Aegean Workshop on Computing, LNCS 319, 170\u2013180.","DOI":"10.1007\/BFb0040385"},{"key":"26_CR19","unstructured":"Y. Saad, M. Schulz: Topological Properties of the Hypercube, Yale University Research Report RR-389, 1985."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1006\/jpdc.1995.1010","volume":"24","author":"X. Sheen","year":"1995","unstructured":"X. Sheen, Q. Hu, W. Liang: Embedding k-ary Complete Trees into Hypercubes, J. Parallel Distrib. Comput., 24(1995), 100\u2013106.","journal-title":"J. Parallel Distrib. Comput."},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Q. Stout: Hypercubes and Pyramids, Proc. of the NATO Advanced Research Workshop on Pyramidal Systems for Computer Vision 1986, 75\u201389.","DOI":"10.1007\/978-3-642-82940-6_5"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/0743-7315(85)90026-7","volume":"2","author":"A. Wu","year":"1985","unstructured":"A. Wu: Embedding of tree networks into hypercubes, J. Parallel Distrib. Comput., 2(1985), 238\u2013249.","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms for Irregularly Structured Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T20:12:55Z","timestamp":1626811975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615491","9783540688082"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0030119","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}