{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:29:14Z","timestamp":1778300954800,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0743-7315(89)90033-6","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"503-520","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":28,"title":["Embedding arbitrary binary trees in a hypercube"],"prefix":"10.1016","volume":"7","author":[{"given":"Alan","family":"Wagner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(89)90033-6_BIB1","series-title":"Proc. 27th FOCS Symposium","article-title":"Optimal simulations of tree machines","author":"Bhatt","year":"1986"},{"key":"10.1016\/0743-7315(89)90033-6_BIB2","article-title":"How to embed trees in hypercubes","author":"Bhatt","year":"1985"},{"key":"10.1016\/0743-7315(89)90033-6_BIB3","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0743-7315(89)90033-6_BIB4","first-page":"39","article-title":"Embedding the directed dichotomic tree into the n-cube","volume":"21","author":"Havel","year":"1982","journal-title":"Rostock Math. Kolloq."},{"key":"10.1016\/0743-7315(89)90033-6_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.21136\/CPM.1984.108506","article-title":"On hamiltonian circuits and spanning trees of hypercubes","volume":"109","author":"Havel","year":"1984","journal-title":"\u010casopis P\u030cest. Mat."},{"key":"10.1016\/0743-7315(89)90033-6_BIB6","doi-asserted-by":"crossref","first-page":"307","DOI":"10.21136\/CPM.1973.117800","article-title":"Embedding the polytomic tree into the n-cube","volume":"98","author":"Havel","year":"1973","journal-title":"\u010casopis P\u030cest. Mat."},{"key":"10.1016\/0743-7315(89)90033-6_BIB7","doi-asserted-by":"crossref","first-page":"338","DOI":"10.21136\/CMJ.1972.101102","article-title":"B-valuations of graphs","volume":"22","author":"Havel","year":"1972","journal-title":"Czechoslovak Math. J"},{"key":"10.1016\/0743-7315(89)90033-6_BIB8","series-title":"Hypercube embedding is NP-complete","author":"Krumme","year":"1985"},{"key":"10.1016\/0743-7315(89)90033-6_BIB9","doi-asserted-by":"crossref","first-page":"164","DOI":"10.21136\/CPM.1974.117839","article-title":"On cubes and dichotomic trees","volume":"99","author":"Nebesk\u00fd","year":"1974","journal-title":"\u010casopis P\u030cest. Mat."},{"key":"10.1016\/0743-7315(89)90033-6_BIB10","series-title":"Graph-Theoretic Concepts in Computer Science (Proc. International Workshop WG80)","first-page":"151","article-title":"Issues in the study of graph embeddings","volume":"Vol 100","author":"Rosenberg","year":"1981"},{"issue":"2","key":"10.1016\/0743-7315(89)90033-6_BIB11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0211018","article-title":"Graphs that are almost binary trees","volume":"11","author":"Rosenberg","year":"1982","journal-title":"SIAM J Comput."},{"issue":"4","key":"10.1016\/0743-7315(89)90033-6_BIB12","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1145\/2157.322401","article-title":"Cost trade-offs in graph embeddings, with applications","volume":"30","author":"Rosenberg","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-7315(89)90033-6_BIB13","article-title":"Embedding binary trees in a hypercube","author":"Wagner","year":"1985"},{"key":"10.1016\/0743-7315(89)90033-6_BIB14","article-title":"Embedding trees in a hypercube","author":"Wagner","year":"1987"},{"key":"10.1016\/0743-7315(89)90033-6_BIB15","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0743-7315(85)90026-7","article-title":"Embedding of tree networks in hypercubes","volume":"2","author":"Wu","year":"1985","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900336?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900336?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:36Z","timestamp":1757514636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0743731589900336"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90033-6","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Embedding arbitrary binary trees in a hypercube","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(89)90033-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}