{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:42Z","timestamp":1725664242424},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583387"},{"type":"electronic","value":"9783540486633"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58338-6_73","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:49:58Z","timestamp":1330271398000},"page":"266-275","source":"Crossref","is-referenced-by-count":3,"title":["Embedding complete binary trees into star networks"],"prefix":"10.1007","author":[{"given":"A.","family":"Bouabdallah","sequence":"first","affiliation":[]},{"given":"M. C.","family":"Heydemann","sequence":"additional","affiliation":[]},{"given":"J.","family":"Opatrny","sequence":"additional","affiliation":[]},{"given":"D.","family":"Sotteau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"19_CR1","unstructured":"S. Akers, D. Harel, and B. Krishnamurthy. The star graph: An attractive alternative to the n-cube. Proceedings of the International Conference in Parallel Processing, pages 393\u2013400, 1987."},{"key":"19_CR2","first-page":"61","volume":"583","author":"S. Bettayeb","year":"1992","unstructured":"S. Bettayeb, B. Cong, M. Girou, and I. Sudborough. Simulating permutation networks on hypercubes. Proceedings of the 1st Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science, 583:61\u201370, 1992.","journal-title":"Proceedings of the 1st Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"N. Biggs. Algebraic graph theory. Cambridge University Press, 1974.","DOI":"10.1017\/CBO9780511608704"},{"key":"19_CR4","unstructured":"A. Bouabdallah. Problems related to parallel and distributed systems. Thesis, Universit\u00e9 de Paris-Sud, 1991."},{"key":"19_CR5","unstructured":"A. Bouabdallah, M.-C. Heydemann, J. Opatrny, and D. Sotteau. Embedding complete binary trees into star and pancake graphs. Research Report 795, L.R.I., Universit\u00e9 de Paris-Sud, 1992."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"C. GowriSankaran. Broadcasting on recursively decomposable Cayley graphs. Discrete Applied Mathematics, to appear, 1993.","DOI":"10.1016\/0166-218X(94)90183-X"},{"key":"19_CR7","unstructured":"J. Jwo, S. Lakshmivarahan, and S. Dhall. Embedding of cycles and grids in star graphs. Proceedings of the 2nd IEEE Parallel and Distributed Processing Symposium, Dallas, Texas, 1990."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"F.T. Leighton. Introduction to parallel algorithms and architectures: Arrays, trees,hypercubes. MorganKaufmann Publ., 1992","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"19_CR9","unstructured":"Z. Miller, D. Pritikin, and I. Sudborough. Small dilation embeddings of hypercubes into star networks. Research Report TX 75083, University of Texas at Dallas."},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-7091-9076-0_13","volume":"7","author":"B. Monien","year":"1990","unstructured":"B. Monien and H. Sudborough. Embedding one interconnection network in another. Computing Supplement, 7:257\u2013282, 1990.","journal-title":"Computing Supplement"},{"key":"19_CR11","unstructured":"M. Nigam, S. Sahni, and B. Krishnamurthy. Embedding hamiltonians and hypercubes in the star interconnection graphs. Proceedings of the International Conference in Parallel Processing, pages III.340\u2013III.343, 1990."},{"key":"19_CR12","unstructured":"O. Sykora, and J. Vrto. On VLSI implementation of the star graph and related networks, preprint, Inst. of Informatics, Slovak Academy of Sciences, 1992."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58338-6_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:49Z","timestamp":1605647989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58338-6_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583387","9783540486633"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58338-6_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}