{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T19:46:29Z","timestamp":1778183189710,"version":"3.51.4"},"reference-count":30,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101528"],"award-info":[{"award-number":["12101528"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016079","name":"Science and Technology Department of Xinjiang Uygur Autonomous Region","doi-asserted-by":"publisher","award":["2020D01C069"],"award-info":[{"award-number":["2020D01C069"]}],"id":[{"id":"10.13039\/100016079","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Doctoral Startup Foundation of Xinjiang University","award":["62031224736"],"award-info":[{"award-number":["62031224736"]}]},{"name":"Tianchi Ph.D Program","award":["tcbs201905"],"award-info":[{"award-number":["tcbs201905"]}]},{"name":"Basic scientific research in universities of Xinjiang Uygur Autonomous Region","award":["202401120001"],"award-info":[{"award-number":["202401120001"]}]},{"name":"Natural Science Foundation of Xiamen","award":["3502Z202373060"],"award-info":[{"award-number":["3502Z202373060"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:p> Embedding an interconnection network into another network is one of the main problems in parallel processing and computing systems. Interconnection networks in multiprocessing systems facilitate effective communication among various system components. Obtaining the minimum cutwidth, congestion, and wirelength in graph embedding problems is of great significance for network design and architecture, where the minimum is taken over all embedding of guest graphs into host graphs, and addressing these issues can reduce time and cost in embedded design. This work aims to accurately calculate the minimum congestion and wirelength for the [Formula: see text] (the [Formula: see text]th Cartesian product of [Formula: see text]) layout into [Formula: see text]-dimensional, [Formula: see text]-dimensional, and [Formula: see text]-dimensional grids by the optimal solution of edge isoperimetric problem on [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0219265924500099","type":"journal-article","created":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T12:18:07Z","timestamp":1715516287000},"source":"Crossref","is-referenced-by-count":4,"title":["Minimum Congestion and Wirelength of Embedding the nth Cartesian Product of K4 into Various Kinds of Grid Networks"],"prefix":"10.1142","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5338-661X","authenticated-orcid":false,"given":"Pingping","family":"Li","sequence":"first","affiliation":[{"name":"Department of College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2621-9022","authenticated-orcid":false,"given":"Mingzu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1410-8509","authenticated-orcid":false,"given":"Litao","family":"Guo","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Xiamen University of Technology, Xiamen 361024, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2024,5,10]]},"reference":[{"key":"S0219265924500099BIB001","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1996.0106"},{"key":"S0219265924500099BIB002","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2021-2003"},{"key":"S0219265924500099BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-023-05140-3"},{"key":"S0219265924500099BIB004","first-page":"693","volume":"23","author":"Bezrukov S. L.","year":"1998","journal-title":"Math. Found. Comput. Sci."},{"key":"S0219265924500099BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00162-4"},{"key":"S0219265924500099BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0219265924500099BIB007","first-page":"115","author":"Bhagat S.","year":"2011","journal-title":"Soc. Netw. Data Ann."},{"key":"S0219265924500099BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.11.004"},{"key":"S0219265924500099BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-019-1893-0"},{"key":"S0219265924500099BIB010","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1065"},{"key":"S0219265924500099BIB011","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511616679"},{"key":"S0219265924500099BIB012","doi-asserted-by":"publisher","DOI":"10.1137\/0112012"},{"key":"S0219265924500099BIB013","volume-title":"Graphs, Networks and Algorithms","author":"Jungnickel D.","year":"2005"},{"key":"S0219265924500099BIB014","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"S0219265924500099BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"S0219265924500099BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.07.003"},{"key":"S0219265924500099BIB017","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265912500041"},{"key":"S0219265924500099BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.013"},{"key":"S0219265924500099BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00161-4"},{"key":"S0219265924500099BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.04.008"},{"key":"S0219265924500099BIB021","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03420-w"},{"key":"S0219265924500099BIB022","doi-asserted-by":"publisher","DOI":"10.3233\/FI-222149"},{"key":"S0219265924500099BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/12.2234"},{"key":"S0219265924500099BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.07.014"},{"key":"S0219265924500099BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.04.010"},{"key":"S0219265924500099BIB026","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265918500111"},{"key":"S0219265924500099BIB027","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.25"},{"key":"S0219265924500099BIB028","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.128"},{"key":"S0219265924500099BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2022.11.011"},{"key":"S0219265924500099BIB031","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2017.2779130"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265924500099","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T03:56:16Z","timestamp":1745380576000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0219265924500099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,10]]},"references-count":30,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["10.1142\/S0219265924500099"],"URL":"https:\/\/doi.org\/10.1142\/s0219265924500099","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,10]]},"article-number":"2450009"}}