将超立方体嵌入环面和路径及/或循环的笛卡尔乘积，以尽量减少线长

IF 1.1 3区计算机科学 Q1 BUSINESS, FINANCE Journal of Computer and System Sciences Pub Date : 2024-11-13 DOI:10.1016/j.jcss.2024.103603

Zhiyi Tang

{"title":"将超立方体嵌入环面和路径及/或循环的笛卡尔乘积，以尽量减少线长","authors":"Zhiyi Tang","doi":"10.1016/j.jcss.2024.103603","DOIUrl":null,"url":null,"abstract":"<div><div>Though embedding problems have been considered for several regular graphs [1], [2], [3], it is still an open problem for hypercube into torus [4], [2]. In the paper, we prove the conjecture mathematically and obtain the minimum wirelength of embedding for hypercube into Cartesian product of paths and/or cycles. In addition, we explain that Gray code embedding is an optimal strategy in such embedding problems.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"148 ","pages":"Article 103603"},"PeriodicalIF":1.1000,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength\",\"authors\":\"Zhiyi Tang\",\"doi\":\"10.1016/j.jcss.2024.103603\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Though embedding problems have been considered for several regular graphs [1], [2], [3], it is still an open problem for hypercube into torus [4], [2]. In the paper, we prove the conjecture mathematically and obtain the minimum wirelength of embedding for hypercube into Cartesian product of paths and/or cycles. In addition, we explain that Gray code embedding is an optimal strategy in such embedding problems.</div></div>\",\"PeriodicalId\":50224,\"journal\":{\"name\":\"Journal of Computer and System Sciences\",\"volume\":\"148 \",\"pages\":\"Article 103603\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2024-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer and System Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0022000024000989\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BUSINESS, FINANCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000024000989","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}

引用次数: 0

摘要

虽然人们已经考虑了几种规则图的嵌入问题 [1]、[2]、[3]，但对于超立方体嵌入环 [4]、[2]，这仍然是一个未决问题。在本文中，我们用数学方法证明了这一猜想，并得到了超立方体嵌入路径和/或循环的笛卡尔积的最小线长。此外，我们还解释了灰色代码嵌入是此类嵌入问题的最优策略。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength

Though embedding problems have been considered for several regular graphs [1], [2], [3], it is still an open problem for hypercube into torus [4], [2]. In the paper, we prove the conjecture mathematically and obtain the minimum wirelength of embedding for hypercube into Cartesian product of paths and/or cycles. In addition, we explain that Gray code embedding is an optimal strategy in such embedding problems.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Computer and System Sciences 工程技术-计算机：理论方法

CiteScore

3.70

自引率

0.00%

发文量

审稿时长

68 days

期刊介绍： The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.