{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T04:53:01Z","timestamp":1767156781319,"version":"build-2065373602"},"reference-count":36,"publisher":"Oxford University Press (OUP)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1093\/comjnl\/bxv021","type":"journal-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T16:36:33Z","timestamp":1428078993000},"page":"3271-3278","source":"Crossref","is-referenced-by-count":5,"title":["A Lower Bound for Dilation of an Embedding"],"prefix":"10.1093","volume":"58","author":[{"given":"R.","family":"Sundara Rajan","sequence":"first","affiliation":[]},{"given":"Paul","family":"Manuel","sequence":"additional","affiliation":[]},{"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[]},{"given":"N.","family":"Parthiban","sequence":"additional","affiliation":[]},{"given":"Mirka","family":"Miller","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2015,4,1]]},"reference":[{"key":"2015113003322605000_58.12.3271.1","doi-asserted-by":"publisher","DOI":"10.1109\/12.9743"},{"key":"2015113003322605000_58.12.3271.2","doi-asserted-by":"crossref","unstructured":"Wong G.K. Coppersmith D.A. (1994) A combinatorial problem related to multimodule memory organization. J. Assoc. Comput. Machin., 21, 392\u2013401.","DOI":"10.1145\/321832.321838"},{"key":"2015113003322605000_58.12.3271.3","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1985.1085667"},{"key":"2015113003322605000_58.12.3271.4","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1002"},{"key":"2015113003322605000_58.12.3271.5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054261"},{"key":"2015113003322605000_58.12.3271.6","doi-asserted-by":"crossref","unstructured":"Xu J.M. (2001) Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Netherlands.","DOI":"10.1007\/978-1-4757-3387-7"},{"key":"2015113003322605000_58.12.3271.7","doi-asserted-by":"crossref","unstructured":"Zhao C. (2011) Circulant Graph Modeling Deterministic Small-World Networks. Intelligent Computing and Information Science, Int. Conf. ICICIS 2011, Chongqing, China, January 8\u20139, pp. 124\u2013127. Springer, Berlin.","DOI":"10.1007\/978-3-642-18134-4_20"},{"key":"2015113003322605000_58.12.3271.8","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00118-6"},{"key":"2015113003322605000_58.12.3271.9","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00161-4"},{"key":"2015113003322605000_58.12.3271.10","unstructured":"Chaudhary V. Aggarwal J.K. (1990) Generalized Mapping of Parallel Algorithms onto Parallel Architectures. Proc. Int\u2019l. Conf. Parallel Process., Urbana-Champaign, IL, USA, August, Vol. 2, pp. 137\u2013141."},{"key":"2015113003322605000_58.12.3271.11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.09.003"},{"key":"2015113003322605000_58.12.3271.12","doi-asserted-by":"crossref","unstructured":"Havel I. (1990) On Certain Trees in Hypercubes. Topics in Combinatorics and Graph Theory, pp. 353\u2013358. Physica-Verlag, Heidelberg.","DOI":"10.1007\/978-3-642-46908-4_40"},{"key":"2015113003322605000_58.12.3271.13","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1013"},{"key":"2015113003322605000_58.12.3271.14","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2001.1734"},{"key":"2015113003322605000_58.12.3271.15","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(03)00037-6"},{"key":"2015113003322605000_58.12.3271.16","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2012.697557"},{"key":"2015113003322605000_58.12.3271.17","doi-asserted-by":"crossref","unstructured":"Manuel P. Rajasingh I. Rajan R.S. (2012) Embedding variants of hypercubes with dilation 2. J. Interconnect. Netw., 13, 1\u201316.","DOI":"10.1142\/S0219265912500041"},{"key":"2015113003322605000_58.12.3271.18","doi-asserted-by":"crossref","unstructured":"Bezrukov S.L. Chavez J.D. Harper L.H. R\u00f6ttger M. Schroeder U.P. (1998) Embedding of Hypercubes into Grids, 23rd Int. Symp. Mathematical Foundations of Computer Science 1998, Brno, Czech Republic, August 24\u201328, pp. 693\u2013701.","DOI":"10.1007\/BFb0055820"},{"key":"2015113003322605000_58.12.3271.19","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu031"},{"key":"2015113003322605000_58.12.3271.20","unstructured":"West D.B. (2000) Introduction to Graph Theory. Prentice-Hall, NJ."},{"key":"2015113003322605000_58.12.3271.21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022444205860"},{"key":"2015113003322605000_58.12.3271.22","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20107"},{"key":"2015113003322605000_58.12.3271.23","unstructured":"Klavzar S. (2008) Coloring Sierpinski graphs and Sierpinski gasket graphs. Taiwanese J. Math., 12, 513\u2013522."},{"key":"2015113003322605000_58.12.3271.24","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(66)80059-5"},{"key":"2015113003322605000_58.12.3271.25","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00256-0"},{"key":"2015113003322605000_58.12.3271.26","unstructured":"Garey M.R. Johnson D.S. (1979) Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco."},{"key":"2015113003322605000_58.12.3271.27","doi-asserted-by":"crossref","unstructured":"Harper L.H. (2004) Global Methods for Combinatorial Isoperimetric Problems. Cambridge University Press, Cambridge.","DOI":"10.1017\/CBO9780511616679"},{"key":"2015113003322605000_58.12.3271.28","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.013"},{"key":"2015113003322605000_58.12.3271.29","doi-asserted-by":"crossref","unstructured":"Danovaro E. Floriani L.D. Magillo P. Puppo E. (2001) Compressing Multiresolution Triangle Meshes. Lecture Notes in Computer Science, pp. 345\u2013364. Springer, Berlin.","DOI":"10.1007\/3-540-47724-1_18"},{"key":"2015113003322605000_58.12.3271.30","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-007-0167-y"},{"key":"2015113003322605000_58.12.3271.31","doi-asserted-by":"crossref","unstructured":"Ivrissimtzis I. R\u201dossl C. Seidel H.-P. (2004) Tree-Based Data Structures for Triangle Mesh Connectivity Encoding. Geometric Modeling for Scientific Visualization, pp. 171\u2013187. Springer, Berlin.","DOI":"10.1007\/978-3-662-07443-5_11"},{"key":"2015113003322605000_58.12.3271.32","doi-asserted-by":"publisher","DOI":"10.1007\/BF01217750"},{"key":"2015113003322605000_58.12.3271.33","doi-asserted-by":"publisher","DOI":"10.1007\/s00209-005-0767-z"},{"key":"2015113003322605000_58.12.3271.34","unstructured":"Parisse D. (2009) On some metric properties of the Sierpinski graphs $S(n,k)$ . Ars Combin., 90, 145\u2013160."},{"key":"2015113003322605000_58.12.3271.35","unstructured":"Elisa C. Laura T.L. (2011) Sierpinsky triangles in stone. On medieval floors in Rome. J. Appl. Math., 4, 114\u2013122."},{"key":"2015113003322605000_58.12.3271.36","doi-asserted-by":"crossref","unstructured":"Baliarda C.P. Borau C.B. Rodero M.N. Robert J.R. (2010) An iterative model for fractal antennas: application to the Sierpinski gasket antenna. IEEE Trans. Antennas and Propagation, 48, 713\u2013719.","DOI":"10.1109\/8.855489"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/58\/12\/3271\/1023459\/bxv021.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T22:01:31Z","timestamp":1566511291000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,1]]},"references-count":36,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2015,11,26]]},"published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1093\/comjnl\/bxv021"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv021","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published":{"date-parts":[[2015,4,1]]}}}