{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T21:21:52Z","timestamp":1771104112856,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T00:00:00Z","timestamp":1323820800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10878-011-9443-x","type":"journal-article","created":{"date-parts":[[2011,12,13]],"date-time":"2011-12-13T15:40:59Z","timestamp":1323790859000},"page":"135-151","source":"Crossref","is-referenced-by-count":25,"title":["Embeddings of circulant networks"],"prefix":"10.1007","volume":"26","author":[{"given":"Indra","family":"Rajasingh","sequence":"first","affiliation":[]},{"given":"Paul","family":"Manuel","sequence":"additional","affiliation":[]},{"given":"M.","family":"Arockiaraj","sequence":"additional","affiliation":[]},{"given":"Bharati","family":"Rajan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,14]]},"reference":[{"key":"9443_CR1","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"SN Bhatt","year":"1984","unstructured":"Bhatt SN, Leighton FT (1984) A\u00a0framework for solving VLSI graph layout problems. J Comput Syst Sci 28:300\u2013343","journal-title":"J Comput Syst Sci"},{"key":"9443_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0166-218X(00)00256-0","volume":"110","author":"SL Bezrukov","year":"2001","unstructured":"Bezrukov SL (2001) Embedding complete trees into the hypercube. Discrete Appl Math 110:101\u2013119","journal-title":"Discrete Appl Math"},{"key":"9443_CR3","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0304-3975(03)00232-9","volume":"307","author":"SL Bezrukov","year":"2003","unstructured":"Bezrukov SL, Els\u00e4sser R (2003) Edge isoperimetric problem for Cartesian powers of regular graphs. Theor Comput Sci 307:473\u2013492","journal-title":"Theor Comput Sci"},{"key":"9443_CR4","doi-asserted-by":"crossref","unstructured":"Bezrukov SL, Chavez JD, Harper LH, R\u00f6ttger M, Schroeder UP (1998) Embedding of hypercubes into grids. MFCS:693\u2013701","DOI":"10.1007\/BFb0055820"},{"key":"9443_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0012-365X(99)00162-4","volume":"213","author":"SL Bezrukov","year":"2000","unstructured":"Bezrukov SL, Chavez JD, Harper LH, R\u00f6ttger M, Schroeder UP (2000a) The congestion of n-cube layout on a rectangular grid. Discrete Math 213:13\u201319","journal-title":"Discrete Math"},{"key":"9443_CR6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s000260050003","volume":"4","author":"SL Bezrukov","year":"2000","unstructured":"Bezrukov SL, Das SK, Els\u00e4sser R (2000b) An edge-isoperimetric problem for powers of the Petersen graph. Ann Comb 4:153\u2013169","journal-title":"Ann Comb"},{"key":"9443_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0012-365X(00)00227-2","volume":"233","author":"R Caha","year":"2001","unstructured":"Caha R, Koubek V (2001) Optimal embeddings of generalized ladders into hypercubes. Discrete Math 233:65\u201383","journal-title":"Discrete Math"},{"key":"9443_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0166-218X(98)00098-5","volume":"87","author":"JD Chavez","year":"1998","unstructured":"Chavez JD, Trapp R (1998) The cyclic cutwidth of trees. Discrete Appl Math 87:25\u201332","journal-title":"Discrete Appl Math"},{"key":"9443_CR9","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press\/McGraw-Hill, New York"},{"key":"9443_CR10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.7155\/jgaa.00069","volume":"7","author":"HN Djidjev","year":"2003","unstructured":"Djidjev HN, Vrto I (2003) Crossing numbers and cutwidths. J Graph Algorithms Appl 7:245\u2013251","journal-title":"J Graph Algorithms Appl"},{"key":"9443_CR11","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin RJ (1965) Topology of series\u2014parallel networks. J Math Anal Appl 10:303\u2013318","journal-title":"J Math Anal Appl"},{"issue":"4","key":"9443_CR12","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TPDS.2007.1003","volume":"18","author":"J Fan","year":"2007","unstructured":"Fan J, Jia X, Lin X (2007) Optimal embeddings of paths with various lengths in twisted cubes. IEEE Trans Parallel Distrib Syst 18(4):511\u2013521","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"9443_CR13","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/s00453-007-9024-7","volume":"51","author":"J Fan","year":"2008","unstructured":"Fan J, Jia X, Lin X (2008) Embedding of cycles in twisted cubes with edge-pancyclic. Algorithmica 51(3):264\u2013282","journal-title":"Algorithmica"},{"key":"9443_CR14","volume-title":"Computers and intractability, a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, San Francisco"},{"issue":"19","key":"9443_CR15","doi-asserted-by":"crossref","first-page":"3794","DOI":"10.1016\/j.ins.2010.06.001","volume":"180","author":"Y Han","year":"2010","unstructured":"Han Y, Fan J, Zhang S, Yang J, Qian P (2010) Embedding meshes into locally twisted cubes. Inf Sci 180(19):3794\u20133805","journal-title":"Inf Sci"},{"key":"9443_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511616679","volume-title":"Global methods for combinatorial isoperimetric problems","author":"LH Harper","year":"2004","unstructured":"Harper LH (2004) Global methods for combinatorial isoperimetric problems. Cambridge University Press, Cambridge"},{"issue":"40\u201342","key":"9443_CR17","doi-asserted-by":"crossref","first-page":"3763","DOI":"10.1016\/j.tcs.2010.06.029","volume":"411","author":"P-L Lai","year":"2010","unstructured":"Lai P-L, Tsai C-H (2010) Embedding of tori and grids into twisted cubes. Theor Comput Sci 411(40\u201342):3763\u20133773","journal-title":"Theor Comput Sci"},{"key":"9443_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<75::AID-JGT1>3.0.CO;2-S","volume":"31","author":"YL Lai","year":"1999","unstructured":"Lai YL, Williams K (1999) A\u00a0survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. J\u00a0Graph Theory 31:75\u201394","journal-title":"J\u00a0Graph Theory"},{"issue":"7","key":"9443_CR19","doi-asserted-by":"crossref","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 (2009) Exact wirelength of hypercube on a\u00a0grid. Discrete Appl Math 157(7):1486\u20131495","journal-title":"Discrete Appl Math"},{"key":"9443_CR20","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0166-218X(99)00161-4","volume":"98","author":"J Opatrny","year":"2000","unstructured":"Opatrny J, Sotteau D (2000) Embeddings of complete binary trees into grids and extended grids with total vertex-congestion\u00a01. Discrete Appl Math 98:237\u2013254","journal-title":"Discrete Appl Math"},{"key":"9443_CR21","unstructured":"Quadras J (2005) Embeddings and interconnection networks. PhD dissertation, University of Madras, India"},{"key":"9443_CR22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.20027","volume":"44","author":"I Rajasingh","year":"2004","unstructured":"Rajasingh I, Quadras J, Manuel P, William A (2004) Embedding of cycles and wheels into arbitrary trees. Networks 44:173\u2013178","journal-title":"Networks"},{"issue":"1\u20132","key":"9443_CR23","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0166-218X(00)00224-9","volume":"108","author":"M Rottger","year":"2001","unstructured":"Rottger M, Schroeder UP (2001) Efficient embeddings of grids into grids. Discrete Appl Math 108(1\u20132):143\u2013173","journal-title":"Discrete Appl Math"},{"issue":"10","key":"9443_CR24","doi-asserted-by":"crossref","first-page":"1847","DOI":"10.1016\/j.disc.2006.09.051","volume":"308","author":"A Vodopivec","year":"2008","unstructured":"Vodopivec A (2008) On embeddings of snarks in the torus. Discrete Math 308(10):1847\u20131849","journal-title":"Discrete Math"},{"key":"9443_CR25","volume-title":"Topological structure and analysis of interconnection networks","author":"J-M Xu","year":"2001","unstructured":"Xu J-M (2001) Topological structure and analysis of interconnection networks. Kluwer Academic, Amsterdam"},{"issue":"2","key":"9443_CR26","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.amc.2008.10.040","volume":"207","author":"M-C Yang","year":"2009","unstructured":"Yang M-C (2009) Path embedding in star graphs. Appl Math Comput 207(2):283\u2013291","journal-title":"Appl Math Comput"},{"issue":"14\u201315","key":"9443_CR27","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ipl.2010.04.007","volume":"110","author":"X Yang","year":"2010","unstructured":"Yang X, Dong Q, Tang YY (2010) Embedding meshes\/tori in faulty crossed cubes. Inf Process Lett 110(14\u201315):559\u2013564","journal-title":"Inf Process Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9443-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9443-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9443-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T21:21:18Z","timestamp":1561065678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9443-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,14]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9443"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9443-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,14]]}}}