{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:24:56Z","timestamp":1725690296287},"publisher-location":"Wiesbaden","reference-count":10,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783519026464"},{"type":"electronic","value":"9783322912305"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-322-91230-5_2","type":"book-chapter","created":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T17:46:58Z","timestamp":1341424018000},"page":"29-45","source":"Crossref","is-referenced-by-count":0,"title":["Effiziente Einbettungen baumartiger Graphen in den Hyperw\u00fcrfel"],"prefix":"10.1007","author":[{"given":"Volker","family":"Heun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","first-page":"81","volume-title":"Proc. of the 3rd Aegean Workshop on Computing","author":"R Anderson","year":"1988","unstructured":"R. Anderson, G. Miller: Deterministic parallel list ranking. Proc. of the 3rd Aegean Workshop on Computing, LNCS 319, 81\u201390, Springer, 1988."},{"issue":"1","key":"2_CR2","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 (1): 151\u2013162, February 1992.","journal-title":"SIAM J. Comput."},{"key":"2_CR3","volume-title":"Parallel algorithms with optimal speedup for bounded treewidth. Technical Report UU-CS-1995-25","author":"H Bodlaender","year":"1995","unstructured":"H. Bodlaender, T. Hagerup: Parallel algorithms with optimal speedup for bounded treewidth. Technical Report UU-CS-1995\u201325, Dept. of Computer Science, University of Utrecht, 1995."},{"key":"2_CR4","volume-title":"Springer","author":"R Cole","year":"1988","unstructured":"R. Cole, U. Vishkin: Optimal parallel algorithms for expression tree evaluation and list ranking. Proc. of the 3rd Aegean Workshop on Computing, LNCS 319, 91\u2013100, Springer, 1988."},{"key":"2_CR5","volume-title":"Efficient embeddings of treelike graphs into hypercubes. Ph.D. Thesis, Fakult\u00e4t f\u00fcr Informatik der TU M\u00fcnchen. Reihe Informatik","author":"V Heun","year":"1996","unstructured":"V. Heun: Efficient embeddings of treelike graphs into hypercubes. Ph.D. Thesis, Fakult\u00e4t f\u00fcr Informatik der TU M\u00fcnchen. Reihe Informatik, Shaker: Aachen, 1996."},{"key":"2_CR6","unstructured":"D. Krumme, K. Venkataraman, G. Cybenko: Hypercube embedding is NP-complete. Proc. of the 1st Conf. on Hypercube Multiprocessors, 148157, SIAM, 1985."},{"issue":"4","key":"2_CR7","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, E. Schwabe: Dynamic tree embed-dings in butterflies and hypercubes. SIAM J. Comput., 21 (4): 639\u2013654, 1992.","journal-title":"SIAM J. Comput."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1137\/0219038","volume":"19","author":"A Wagner","year":"1990","unstructured":"A. Wagner, D. Corneil: Embedding trees in a hypercube is NP-complete. SIAM J. Comput., 19: 570\u2013590, 1990.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(93)90170-S","volume":"43","author":"A Wagner","year":"1993","unstructured":"A. Wagner, D. Corneil: On the complexity of the embedding problem for hypercube related graphs. Discrete Appl. Math., 43 (1): 75\u201395, 1993.","journal-title":"Discrete Appl. Math."},{"key":"2_CR10","volume-title":"The complexity of parallel computation. Technical Report","author":"J Wyllie","year":"1979","unstructured":"J. Wyllie: The complexity of parallel computation. Technical Report 79387, Dept. of Computer Science, Cornell University, 1979. Ph.D. Thesis."}],"container-title":["Ausgezeichnete Informatikdissertationen 1996"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-91230-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T20:45:19Z","timestamp":1619988319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-91230-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783519026464","9783322912305"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-91230-5_2","relation":{},"subject":[],"published":{"date-parts":[[1998]]}}}