{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:20Z","timestamp":1742913740292,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_26","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"298-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Embedding Circulant Networks into Butterfly and Benes Networks"],"prefix":"10.1007","author":[{"given":"R. Sundara","family":"Rajan","sequence":"first","affiliation":[]},{"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Manuel","sequence":"additional","affiliation":[]},{"given":"T. M.","family":"Rajalaxmi","sequence":"additional","affiliation":[]},{"given":"N.","family":"Parthiban","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"unstructured":"Chaudhary, V., Aggarwal, J.K.: Generalized mapping of parallel algorithms onto parallel architectures. In: Proceeding of International Conference on Parallel Processing, pp. 137\u2013141 (1990)","key":"26_CR1"},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1016\/j.dam.2006.09.003","volume":"155","author":"T Dvor\u0302\u00e1k","year":"2007","unstructured":"Dvor\u0302\u00e1k, T.: Dense sets and embedding binary trees into hypercubes. Discrete Appl. Math. 155(4), 506\u2013514 (2007)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Bezrukov, S.L., Chavez, J.D., Harper, L.H., R\u00f6ttger, M., Schroeder, U.P.: Embedding of hypercubes into grids. In: Mortar Fire Control System, pp.693\u2013701 (1998)","key":"26_CR3","DOI":"10.1007\/BFb0055820"},{"issue":"15","key":"26_CR4","doi-asserted-by":"publisher","first-page":"1970","DOI":"10.1080\/00207160.2012.697557","volume":"89","author":"I Rajasingh","year":"2012","unstructured":"Rajasingh, I., Rajan, B., Rajan, R.S.: Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs. Int. J. Comput. Math. 89(15), 1970\u20131978 (2012)","journal-title":"Int. J. Comput. Math."},{"issue":"6","key":"26_CR5","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/S0743-7315(03)00037-6","volume":"63","author":"AK Gupta","year":"2003","unstructured":"Gupta, A.K., Nelson, D., Wang, H.: Efficient embeddings of ternary trees into hypercubes. J. Parallel Distrib. Comput. 63(6), 619\u2013629 (2003)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2\u20133","key":"26_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0166-218X(00)00256-0","volume":"110","author":"SL Bezrukov","year":"2001","unstructured":"Bezrukov, S.L.: Embedding complete trees into the hypercube. Discrete Appl. Math. 110(2\u20133), 101\u2013119 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"26_CR7","first-page":"1","volume":"13","author":"P Manuel","year":"2012","unstructured":"Manuel, P., Rajasingh, I., Rajan, R.S.: Embedding variants of hypercubes with dilation 2. J. Interconnect. Netw. 13(1\u20132), 1\u201316 (2012)","journal-title":"J. Interconnect. Netw."},{"issue":"12","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1109\/12.9743","volume":"37","author":"P Ramanathan","year":"1988","unstructured":"Ramanathan, P., Shin, K.G.: Reliable broadcast in hypercube multicomputers. IEEE Trans. Comput. 37(12), 1654\u20131657 (1988)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1145\/321832.321838","volume":"21","author":"GK Wong","year":"1994","unstructured":"Wong, G.K., Coppersmith, D.A.: A combinatorial problem related to multimodule memory organization. J. Assoc. Comput. Mach. 21(3), 392\u2013401 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"12","key":"26_CR10","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1109\/TCS.1985.1085667","volume":"32","author":"FT Boesch","year":"1985","unstructured":"Boesch, F.T., Wang, J.: Reliable circulant networks with minimum transmission delay. IEEE Trans. Circuit Syst. 32(12), 1286\u20131291 (1985)","journal-title":"IEEE Trans. Circuit Syst."},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"JC Bermond","year":"1995","unstructured":"Bermond, J.C., Comellas, F., Hsu, D.F.: Distributed loop computer networks: a survey. Surv. J. Parallel Distrib. Comput. 24(1), 2\u201310 (1995)","journal-title":"Surv. J. Parallel Distrib. Comput."},{"issue":"10","key":"26_CR12","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/12.93744","volume":"40","author":"R Beivide","year":"1991","unstructured":"Beivide, R., Herrada, E., Balcazar, J.L., Arruabarrena, A.: Optimal distance networks of low degree for parallel computers. IEEE Trans. Comput. 40(10), 1109\u20131124 (1991)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TCOM.1972.1091214","volume":"20","author":"RS Wilkov","year":"1972","unstructured":"Wilkov, R.S.: Analysis and design of reliable computer networks. IEEE Trans. Commun. 20(3), 660\u2013678 (1972)","journal-title":"IEEE Trans. Commun."},{"key":"26_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7","volume-title":"Topological Structure and Analysis of Interconnection Networks","author":"JM Xu","year":"2001","unstructured":"Xu, J.M.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht (2001)"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.jda.2006.08.003","volume":"6","author":"P Manuel","year":"2008","unstructured":"Manuel, P., Abd-El-Barra, M.I., Rajasingh, I., Rajan, B.: An efficient representation of benes networks and its applications. J. Discrete Algorithms 6(1), 11\u201319 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"26_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"26_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511616679","volume-title":"Global Methods for Combinatorial Isoperimetric Problems","author":"LH Harper","year":"2004","unstructured":"Harper, L.H.: Global Methods for Combinatorial Isoperimetric Problems. Cambridge University Press, Cambridge (2004)"},{"unstructured":"Rajan, R.S., Miller, M., Rajasingh, I., Manuel, P.: Embedding circulant networks into certain trees. J. Comb. Optim. (submitted)","key":"26_CR18"},{"unstructured":"Rajan, R.S., Manuel, P., Rajasingh, I., Parthiban, N., Miller, M.: A lower bound for dilation of an embedding. Comput. J. (2015).\u00a0http:\/\/comjnl.oxfordjournals.org\/content\/early\/2015\/04\/01\/comjnl.bxv021","key":"26_CR19"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T09:55:21Z","timestamp":1676454921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}