{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:18:55Z","timestamp":1725815935998},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_22","type":"book-chapter","created":{"date-parts":[[2015,1,27]],"date-time":"2015-01-27T20:23:50Z","timestamp":1422390230000},"page":"229-237","source":"Crossref","is-referenced-by-count":0,"title":["A Tight Bound for Congestion of an Embedding"],"prefix":"10.1007","author":[{"given":"Paul","family":"Manuel","sequence":"first","affiliation":[]},{"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[]},{"given":"R. Sundara","family":"Rajan","sequence":"additional","affiliation":[]},{"given":"N.","family":"Parthiban","sequence":"additional","affiliation":[]},{"given":"T. M.","family":"Rajalaxmi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0166-218X(99)00161-4","volume":"98","author":"J. Opatrny","year":"2000","unstructured":"Opatrny, J., Sotteau, D.: Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1. Discrete Applied Mathematics\u00a098, 237\u2013254 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR2","unstructured":"Chaudhary, V., Aggarwal, J.K.: Generalized mapping of parallel algorithms onto parallel architectures. In: Proc. Int. Conf. Parallel Process., pp. 137\u2013141 (1990)"},{"issue":"4","key":"22_CR3","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 Applied Mathematics\u00a0155(4), 506\u2013514 (2007)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"22_CR4","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.dam.2010.12.001","volume":"159","author":"P. Manuel","year":"2010","unstructured":"Manuel, P.: Minimum average congestion of enhanced and augmented hypercube into complete binary tree. Discrete Applied Mathematics\u00a0159(5), 360\u2013366 (2010)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/(SICI)1097-0037(199901)33:1<71::AID-NET5>3.0.CO;2-3","volume":"33","author":"A. Matsubayashi","year":"1999","unstructured":"Matsubayashi, A., Ueno, S.: Small congestion embedding of graphs into hypercubes. Networks\u00a033(1), 71\u201377 (1999)","journal-title":"Networks"},{"issue":"17","key":"22_CR6","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/j.dam.2011.07.003","volume":"159","author":"P. Manuel","year":"2011","unstructured":"Manuel, P., Arockiaraj, M., Rajasingh, I., Rajan, B.: Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discrete Applied Mathematics\u00a0159(17), 2109\u20132116 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR7","unstructured":"Matsubayashi, A.: Separator-Based Graph Embedding into Multidimensional Grids with Small Edge-Congestion, CoRR abs\/1402.7293 (2014)"},{"key":"22_CR8","volume-title":"Modern circuit placement, Part 3","author":"T. Taghavi","year":"2011","unstructured":"Taghavi, T., Yang, X., Choi, B.-K., Wang, M., Sarrafzadeh, M.: Modern circuit placement, Part 3. Springer, US (2011)"},{"issue":"12","key":"22_CR9","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 Transactions on Computers\u00a037(12), 1654\u20131657 (1988)","journal-title":"IEEE Transactions on Computers"},{"issue":"7","key":"22_CR10","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y. Saad","year":"1988","unstructured":"Saad, Y., Schultz, M.H.: Topological properties of hypercubes. IEEE Transactions on Computers\u00a037(7), 867\u2013872 (1988)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/net.10033","volume":"40","author":"S.A. Choudum","year":"2002","unstructured":"Choudum, S.A., Sunitha, V.: Augmented cubes. Networks\u00a040(2), 71\u201384 (2002)","journal-title":"Networks"},{"issue":"7","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1016\/j.dam.2008.09.013","volume":"157","author":"P. Manuel","year":"2009","unstructured":"Manuel, P., Rajasingh, I., Rajan, B., Mercy, H.: Exact wirelength of hypercube on a grid. Discrete Applied Mathematics\u00a0157(7), 1486\u20131495 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/jpdc.1995.1013","volume":"24","author":"W.K. Chen","year":"1995","unstructured":"Chen, W.K., Stallmann, M.F.M.: On embedding binary trees into hypercubes. Journal on Parallel and Distributed Computing\u00a024, 132\u2013138 (1995)","journal-title":"Journal on Parallel and Distributed Computing"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/BFb0055820","volume-title":"Mathematical Foundations of Computer Science 1998","author":"S.L. Bezrukov","year":"1998","unstructured":"Bezrukov, S.L., Chavez, J.D., Harper, L.H., R\u00f6ttger, M., Schroeder, U.-P.: Embedding of hypercubes into grids. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 693\u2013701. Springer, Heidelberg (1998)"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0012-365X(99)00162-4","volume":"213","author":"S.L. Bezrukov","year":"2000","unstructured":"Bezrukov, S.L., Chavez, J.D., Harper, L.H., R\u00f6ttger, M., Schroeder, U.P.: The congestion of n-cube layout on a rectangular grid. Discrete Mathematics\u00a0213, 13\u201319 (2000)","journal-title":"Discrete Mathematics"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Xu, J.M.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-1-4757-3387-7"},{"issue":"15","key":"22_CR17","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. International Journal of Computer Mathematics\u00a089(15), 1970\u20131978 (2012)","journal-title":"International Journal of Computer Mathematics"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/12.4611","volume":"37","author":"H. Katseff","year":"1988","unstructured":"Katseff, H.: Incomplete Hypercubes. IEEE Transactions on Computers\u00a037, 604\u2013608 (1988)","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Harper, L.H.: Global Methods for Combinatorial Isoperimetric Problems. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511616679"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1109\/71.642951","volume":"8","author":"H.-L. Chen","year":"1997","unstructured":"Chen, H.-L., Tzeng, N.-F.: A boolean expression-based approach for maximum incomplete subcube identification in faulty hypercubes. IEEE Transactions on Parallel and Distributed Systems\u00a08, 1171\u20131183 (1997)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01204731","volume":"8","author":"A.J. Boals","year":"1994","unstructured":"Boals, A.J., Gupta, A.K., Sherwani, N.A.: Incomplete hypercubes: Algorithms and embeddings. The Journal of Supercomputing\u00a08, 263\u2013294 (1994)","journal-title":"The Journal of Supercomputing"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2014.05.007","volume":"542","author":"R.S. Rajan","year":"2014","unstructured":"Rajan, R.S., Rajasingh, I., Parthiban, N., Rajalaxmi, T.M.: A linear time algorithm for embedding hypercube into cylinder and torus. Theoretical Computer Science\u00a0542, 108\u2013115 (2014)","journal-title":"Theoretical Computer Science"},{"issue":"14-15","key":"22_CR23","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ipl.2010.04.007","volume":"110","author":"X. Yang","year":"2010","unstructured":"Yang, X., Dong, Q., Tan, Y.Y.: Embedding meshes\/tori in faulty crossed cubes. Information Processing Letters\u00a0110(14-15), 559\u2013564 (2010)","journal-title":"Information Processing Letters"},{"key":"22_CR24","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. 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)"},{"issue":"1-2","key":"22_CR25","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. Journal of Interconnection Networks\u00a013(1-2), 1\u201316 (2012)","journal-title":"Journal of Interconnection Networks"},{"key":"22_CR26","unstructured":"Rajan, R.S., Manuel, P., Rajasingh, I., Parthiban, N., Miller, M.: A lower bound for dilation of an embedding, IEEE Transactions on Computers (submitted)"},{"key":"22_CR27","unstructured":"Miller, M., Rajan, R.S., Parthiban, N., Rajasingh, I.: Minimum linear arrangement of incomplete hypercubes, The Computer Journal abstract (2014), \n                    \n                      http:\/\/comjnl.oxfordjournals.org\/content\/early\/2014\/05\/09\/comjnl.bxu031"},{"issue":"1-3","key":"22_CR28","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0012-365X(99)00162-4","volume":"213","author":"S.L. Bezrukov","year":"2000","unstructured":"Bezrukov, S.L., Chavez, J.D., Harper, L.H., Rottger, M., Schroeder, U.-P.: The congestion of n-cube layout on a rectangular grid. Discrete Mathematics\u00a0213(1-3), 13\u201319 (2000)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:08:31Z","timestamp":1559092111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}