Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes

DOI10.1016/j.tcs.2013.04.002zbMath1277.68040OpenAlexW2074859967MaRDI QIDQ387813

Shurong Zhang, Shi-ying Wang

Publication date: 17 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.002

zbMATH Keywords

parallel computinginterconnection networksdisjoint paths\(k\)-ary \(n\)-cubes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)

Related Items (21)

Algorithms for finding disjoint path covers in unit interval graphs ⋮ Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Paired 2-disjoint path covers of multidimensional torus networks with faulty edges ⋮ The reliability analysis of \(k\)-ary \(n\)-cube networks ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ Ore-type degree conditions for disjoint path covers in simple graphs ⋮ One-to-one disjoint path covers in digraphs ⋮ Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Torus-like graphs and their paired many-to-many disjoint path covers ⋮ Unnamed Item ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ Many-to-many disjoint paths in hypercubes with faulty vertices ⋮ Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements ⋮ Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks ⋮ Vertex-disjoint paths joining adjacent vertices in faulty hypercubes ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids

Cites Work

• Unnamed Item
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
• Many-to-many disjoint paths in faulty hypercubes
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• The two-equal-disjoint path cover problem of matching composition network
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Lee distance and topological properties of k-ary n-cubes
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements

This page was built for publication: Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes