{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:25:18Z","timestamp":1761647118385},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4946,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0166-218x(99)00161-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:07:13Z","timestamp":1027613233000},"page":"237-254","source":"Crossref","is-referenced-by-count":43,"title":["Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1"],"prefix":"10.1016","volume":"98","author":[{"given":"J","family":"Opatrny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D","family":"Sotteau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00161-4_BIB1","doi-asserted-by":"crossref","unstructured":"T. Blank, The MasPar MP-1 architecture, Proceedings of the 35th International Conference of the IEEE Comp. Society, San Francisco, 1990.","DOI":"10.1109\/CMPCON.1990.63648"},{"key":"10.1016\/S0166-218X(99)00161-4_BIB2","unstructured":"S.A. Browning, The tree machine, a highly concurrent computing environment, PhD Thesis, Dept. of Computer Science, CIT, 1980."},{"key":"10.1016\/S0166-218X(99)00161-4_BIB3","unstructured":"B. Ducourthial, A. M\u00e9rigot, Graph embedding in the associative mesh model, IEEE Trans. Comput. (1996) submitted for publication."},{"key":"10.1016\/S0166-218X(99)00161-4_BIB4","doi-asserted-by":"crossref","unstructured":"D. Dulac, A. M\u00e9rigot, S. Mohammadi, Associative meshes: a new architecture for image analysis applications, Proceedings of the IEEE Workhop on Computer Architecture for Machine Perception, 1993, pp. 393\u2013399.","DOI":"10.1109\/CAMP.1993.622496"},{"key":"10.1016\/S0166-218X(99)00161-4_BIB5","doi-asserted-by":"crossref","unstructured":"D. Gordon, Efficient embeddings of binary trees in VLSI arrays, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, 1987, pp. 1009\u20131018.","DOI":"10.1109\/TC.1987.5009532"},{"key":"10.1016\/S0166-218X(99)00161-4_BIB6","doi-asserted-by":"crossref","unstructured":"R. Heckmann, R. Klasing, B. Monien, W. Unger, Optimal embedding of complete binary trees into lines and grids, Proceedings of the 17th Graph-Theoretic Concept in Computer Science, Lecture Notes in Computer Science, vol. 570, 1987, pp. 25\u201335.","DOI":"10.1007\/3-540-55121-2_3"},{"key":"10.1016\/S0166-218X(99)00161-4_BIB7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/10637199608915560","article-title":"Embedding complete binary trees into extended grids with edge-congestion 1","volume":"8","author":"Heydemann","year":"1996","journal-title":"Parallel Algorithms Appl."},{"key":"10.1016\/S0166-218X(99)00161-4_BIB8","doi-asserted-by":"crossref","unstructured":"D. Krizanc, L. Narajanan, Sorting and selection on arrays with diagonal connections, Proceedings of Canada\u2013France Conference on Parallel Computing, Lecture Notes in Computer Science, vol. 805, 1994, pp. 121\u2013136.","DOI":"10.1007\/3-540-58078-6_12"},{"key":"10.1016\/S0166-218X(99)00161-4_BIB9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-7091-9076-0_13","article-title":"Embedding one interconnection network in another","volume":"7","author":"Monien","year":"1990","journal-title":"Comput. Suppl."},{"key":"10.1016\/S0166-218X(99)00161-4_BIB10","unstructured":"J.D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockuille, MD, 1984."},{"key":"10.1016\/S0166-218X(99)00161-4_BIB11","doi-asserted-by":"crossref","unstructured":"H.Y. Youn, A.D. Singh, Near optimal embedding of binary tree architectures in VLSI, Proceedings of the 8th International Conference on Distributed Computing Systems, 1988, pp. 86\u201393.","DOI":"10.1109\/DCS.1988.12503"},{"key":"10.1016\/S0166-218X(99)00161-4_BIB12","doi-asserted-by":"crossref","unstructured":"P. Zienicke, Embeddings of treelike graphs into 2-dimensional meshes, Proceedings of the Conference on the Graph Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, vol. 484, 1990, pp. 182\u2013192.","DOI":"10.1007\/3-540-53832-1_42"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001614?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001614?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T11:23:39Z","timestamp":1556277819000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0166218X99001614"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00161-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}