 The disjoint path cover in the data center network HSDC with prescribed vertices in each pathYujia He, Shurong Zhang, Lin Chen and Weihua Yang Applied Mathematics and Computation, 2023, vol. 459, issue C Abstract: The n-dimensional HSDC with the logic graph Hn is one of the most attractive server-centric data center networks for high incremental scalability. The routing design in network topology is very important for information transmission. In particular, the application of disjoint path covers can solve various problems such as program code optimization and mapping parallel programs to parallel structures. Hn consists of 2n cliques and each two vertices in a clique are adjacent. For any vertex sets {x,u} and {y,v} in W and B, respectively, and any two disjoint vertex sets A1,A2 in some clique, where (W,B) is a bipartition of Hn, in this paper, we prove that, when |Ai|≠1 and Ai∩{x,y,u,v}=∅ for i=1,2, if |A1∪A2|≤n−3, then there exists an (x,y)-path P1 and a (u,v)-path P2 in Hn passing through A1 and A2, respectively, such that P1 and P2 have no common vertices and P1∪P2 contains all vertices of Hn. Then P1∪P2 is called the 2-disjoint path cover in Hn and we propose the efficient algorithms for the path design. Furthermore, we prove that our main result is optimal. Keywords: Data center networks; HSDC; Disjoint path covers; Prescribed vertex sets; Hamiltonian paths (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:459:y:2023:i:c:s0096300323004319 DOI: 10.1016/j.amc.2023.128262 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.