{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:16Z","timestamp":1725664936945},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625599"},{"type":"electronic","value":"9783540680727"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62559-3_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:41:29Z","timestamp":1330278089000},"page":"56-66","source":"Crossref","is-referenced-by-count":0,"title":["Embedding complete binary trees in product graphs"],"prefix":"10.1007","author":[{"given":"Adrienne","family":"Broadwater","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kemal","family":"Efe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"no.1","key":"6_CR1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1006\/jpdc.1996.0073","volume":"35","author":"K. Efe","year":"1996","unstructured":"K. Efe, \u201cEmbedding Large Complete Binary Trees in Hypercubes with Load Balancing,\u201d Journal of Parallel and Distributed Computing, vol. 35, no. 1, May 1996, pp. 104\u2013109.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"K. Efe and A. Fern\u00e1ndez, \u201cMesh Connected Trees: A Bridge between Grids and Meshes of Trees,\u201d IEEE Transactions on Parallel and Distributed Systems. To appear in 1996.","DOI":"10.1109\/71.553283"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1109\/71.466633","volume":"6","author":"K. Efe","year":"1995","unstructured":"K. Efe and A. Fern\u00e1ndez, \u201cProducts of Networks with Logarithmic Diameter and Fixed Degree,\u201d IEEE Transactions on Parallel and Distributed Systems, vol. 6, pp. 963\u2013975, Sept. 1995.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"no.1","key":"6_CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1142\/S0129626492000131","volume":"2","author":"R. Feldmann","year":"1992","unstructured":"R. Feldmann and W. Unger, \u201cThe Cube-Connected Cycles Network is a Subgraph of the Butterfly Network,\u201d Parallel Processing Letters, vol. 2, no. 1, pp. 13\u201319, 1992.","journal-title":"Parallel Processing Letters"},{"key":"6_CR5","volume-title":"PhD thesis","author":"A. Fern\u00e1ndez","year":"1994","unstructured":"A. Fern\u00e1ndez, Homogeneous Product Networks for Processor Interconnection. PhD thesis, U. of Southwestern Louisiana, Lafayette, LA, Oct. 1994."},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TC.1982.1675994","volume":"31","author":"J. P. Fishburn","year":"1982","unstructured":"J. P. Fishburn and R. A. Finkel, \u201cQuotient Networks,\u201d IEEE Transactions on Computers, vol. 31, pp. 288\u2013295, Apr. 1982.","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"R. Koch, T. Leighton, B. Maggs, S. Rao, and A. L. Rosenberg, \u201cWork-Preserving Emulations of Fixed-Connection Networks,\u201d in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, (Seattle), pp. 227\u2013240, May 1989.","DOI":"10.21236\/ADA211915"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0166-218X(92)90152-Z","volume":"37\/38","author":"A. L. Rosenberg","year":"1992","unstructured":"A. L. Rosenberg, \u201cProduct-Shuffle Networks: Toward Reconciling Shuffles and Butterflies,\u201d Discrete Applied Mathematics, vol. 37\/38, pp. 465\u2013488, July 1992.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62559-3_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:14Z","timestamp":1605629594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62559-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540625599","9783540680727"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-62559-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}