{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:51:27Z","timestamp":1760597487135},"reference-count":12,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1051\/ita\/2011120","type":"journal-article","created":{"date-parts":[[2011,9,22]],"date-time":"2011-09-22T08:13:35Z","timestamp":1316679215000},"page":"399-411","source":"Crossref","is-referenced-by-count":6,"title":["Square-root rule of two-dimensional bandwidth problem"],"prefix":"10.1051","volume":"45","author":[{"given":"Lan","family":"Lin","sequence":"first","affiliation":[]},{"given":"Yixun","family":"Lin","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,9,22]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Bhatt S.N. and Leighton F.T., A framework for solving VLSI graph layout problem.J. Comput. System Sci.28(1984) 300\u2013343.","DOI":"10.1016\/0022-0000(84)90071-0"},{"key":"R2","unstructured":"Bezrukov S.L., Chavez J.D., Harper L.H., R\u00f6ttger M. and Schroeder U.P., Embedding of hypercubes into grids, MFCS\u201998.Lect. Notes Comput. Sci.1450(1998) 693\u2013701."},{"key":"R3","unstructured":"Bezrukov S.L., Chavez J.D., Harper L.H., R\u00f6ttger M. and Schroeder U.P., The congestion of n-cube layout on a rectangular grid.Discrete Math.213(2000) 13\u201319."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Chinn P.Z., Chv\u00e1talov\u00e1 J., Dewdney A.K. and Gibbs N.E., The bandwidth problem for graphs and matrices \u2013 A survey.J. Graph Theor.6(1982) 223\u2013254.","DOI":"10.1002\/jgt.3190060302"},{"key":"R5","unstructured":"F.R.K. Chung, Labelings of graphs, inSelected topics in graph theory, L.W. Beineke and R.J. Wilson, Eds.3(1988) 151\u2013168."},{"key":"R6","unstructured":"Diaz J., Petit J. and Serna M., A survey of graph layout problems.ACM Comput. Surv.34(2002) 313\u2013356."},{"key":"R7","unstructured":"Hochberg R., McDiarmid C. and Saks M., On the bandwidth of triangulated triangles.Discrete Math.138(1995) 261\u2013265."},{"key":"R8","unstructured":"Li Q., Tao M. and Shen Y., The bandwidth of torus grid graphsCm\u00d7Cn.J. China Univ. Sci. Tech.11(1981) 1\u201316."},{"key":"R9","unstructured":"Lin L. and Lin Y., Two models of two-dimensional bandwidth problems,Inform. Process. Lett.110(2010) 469\u2013473."},{"key":"R10","unstructured":"Mai J. and Luo H., Some theorems on the bandwidth of a graph.Acta Math. Appl. Sinica7(1984) 86\u201395."},{"key":"R11","unstructured":"Manuel P., Rajasingh I., Rajan B. and Mercy H., Exact wirelength of hypercubes on a grid.Discrete Appl. Math.157(2009) 1486\u20131495."},{"key":"R12","unstructured":"Opatrny J. and Sotteau D., Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1.Discrete Appl. Math.98(2000) 237\u2013254."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011120\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T05:25:47Z","timestamp":1560662747000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,22]]},"references-count":12,"journal-issue":{"issue":"4"},"alternative-id":["ita110006"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2011120","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,22]]}}}