The two-equal-disjoint path cover problem of matching composition network

DOI10.1016/j.ipl.2007.12.006zbMath1186.68025OpenAlexW2087615244MaRDI QIDQ963388

Hong-Chun Hsu, Pao-Lien Lai

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.12.006

zbMATH Keywords

interconnection networksmatching composition networksHamiltonian-connectivity\(k\) disjoint path covertwo-equal-disjoint path cover

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (24)

Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph ⋮ Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Improving the panconnectedness property of locally twisted cubes ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes ⋮ The paths embedding of the arrangement graphs with prescribed vertices in given position ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ Ore-type degree conditions for disjoint path covers in simple graphs ⋮ Super spanning connectivity on WK-recursive networks ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ Edge-fault-tolerant strong Menger edge connectivity on regular graphs ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Paired many-to-many disjoint path covers of the hypercubes ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ General-demand disjoint path covers in a graph with faulty elements ⋮ Vertex-pancyclicity of twisted cubes with maximal faulty edges ⋮ Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs ⋮ Many-to-many disjoint paths in faulty hypercubes ⋮ Paired many-to-many disjoint path covers of hypercubes with faulty edges ⋮ Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes ⋮ Optimizing Hamiltonian panconnectedness for the crossed cube architecture ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids

Cites Work

• Unnamed Item
• Fault-tolerant Hamiltonicity of twisted cubes
• Topological properties of the crossed cube architecture
• The Mobius cubes
• Computing and Combinatorics
• The twisted N-cube with application to multiprocessing
• Algorithms and Computation

This page was built for publication: The two-equal-disjoint path cover problem of matching composition network