Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
From MaRDI portal
Publication:526866
DOI10.1016/j.tcs.2017.03.008zbMath1370.68019OpenAlexW2600917856MaRDI QIDQ526866
Lichao Chen, Guoren Wang, Jing Li
Publication date: 15 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.03.008
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (5)
Characterization of interval graphs that are unpaired 2-disjoint path coverable ⋮ Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks ⋮ Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults ⋮ Torus-like graphs and their paired many-to-many disjoint path covers ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements
Cites Work
- Unnamed Item
- Unnamed Item
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
- Two spanning disjoint paths with required length in generalized hypercubes
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
- Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
- An efficient algorithm to construct disjoint path covers of DCell networks
- Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
- Edge-disjoint spanners in tori
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids
- Paired many-to-many disjoint path covers of the hypercubes
- Hamiltonicity of the Torus Network Under the Conditional Fault Model
This page was built for publication: Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
