{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:03:22Z","timestamp":1725487402339},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662006"},{"type":"electronic","value":"9783540486862"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48686-0_37","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:12Z","timestamp":1184601252000},"page":"370-378","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Congestion Embedding of Complete Binary Trees into Tori"],"prefix":"10.1007","author":[{"given":"Akira","family":"Matsubayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"Takasu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,25]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1109\/TC.1987.5009532","volume":"C-36","author":"D. Gordon","year":"1987","unstructured":"D. Gordon: Efficient embeddings of binary trees in VLSI arrays. IEEE Trans. Computers C-36 (1987) 1009\u20131018","journal-title":"IEEE Trans. Computers"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/0196-6774(91)90004-I","volume":"12","author":"Y. M. Kim","year":"1991","unstructured":"Y. M. Kim and T.-H. Lai.: The complexity of congestion-1 embedding in a hypercube. J. Algorithms 12 (1991) 246\u2013280","journal-title":"J. Algorithms"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/71.503774","volume":"7","author":"S.-K. Lee","year":"1996","unstructured":"S.-K. Lee and H.-A. Choi: Embedding of complete binary trees into meshes with row-column routing. IEEE Trans. Parallel and Distributed Systems. 7 (1996) 493\u2013497","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"37_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/3-540-53832-1_42","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P. Zienicke","year":"1991","unstructured":"P. Zienicke: Embeddings of treelike graphs into 2-dimensional meshes. In: R. H. M\u00f6hring (eds.): Graph-Theoretic Concepts in Computer Science (Proceedings of WG'90). Lecture Notes in Computer Science, Vol. 484. Springer-Verlag, Berlin (1991) 182\u2013192"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48686-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T23:47:03Z","timestamp":1558482423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48686-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662006","9783540486862"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-48686-0_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"25 June 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}