The disjoint path cover in the data center network HSDC with prescribed vertices in each path

DOI10.1016/j.amc.2023.128262MaRDI QIDQ6048642

Shurong Zhang, Weihua Yang, Lin Chen, Yujia He

Publication date: 11 October 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian pathsdata center networksdisjoint path coversHSDCprescribed vertex sets

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian cycle embedding for fault tolerance in balanced hypercubes
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
• Survey on path and cycle embedding in some networks
• The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
• On exploiting priority relation graph for reliable multi-path communication in mobile social networks
• Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
• Disjoint cycles in hypercubes with prescribed vertices in each cycle
• Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
• The edge-disjoint paths problem is NP-complete for series-parallel graphs

This page was built for publication: The disjoint path cover in the data center network HSDC with prescribed vertices in each path