Many-to-many disjoint paths in faulty hypercubes
From MaRDI portal
Publication:730958
DOI10.1016/j.ins.2009.05.006zbMath1193.68050OpenAlexW2004178113MaRDI QIDQ730958
Publication date: 1 October 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.05.006
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (42)
Algorithms for finding disjoint path covers in unit interval graphs ⋮ Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Edge-fault-tolerant diameter and bipanconnectivity of hypercubes ⋮ Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes ⋮ Paired many-to-many disjoint path covers in faulty hypercubes ⋮ Note on the subgraph component polynomial ⋮ Paired 2-disjoint path covers of multidimensional torus networks with faulty edges ⋮ Conditional edge-fault-tolerant Hamiltonicity of dual-cubes ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ 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 ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ An efficient construction of one-to-many node-disjoint paths in folded hypercubes ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ Paired many-to-many disjoint path covers of the hypercubes ⋮ Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph ⋮ Disjoint path covers in cubes of connected graphs ⋮ Unnamed Item ⋮ 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 ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ Many-to-many disjoint paths in hypercubes with faulty vertices ⋮ Independent spanning trees on even networks ⋮ The triangular pyramid: Routing and topological properties ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs ⋮ The spanning connectivity of folded hypercubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Maximally local connectivity and connected components of augmented cubes ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Hamiltonicity of hypercubes with faulty vertices ⋮ Paired many-to-many disjoint path covers of hypercubes with faulty edges ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes ⋮ Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes ⋮ Vertex-disjoint paths joining adjacent vertices in faulty hypercubes ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids ⋮ The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
- The two-equal-disjoint path cover problem of matching composition network
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Path partitions of hypercubes
- On path bipancyclicity of hypercubes
- Path embedding in faulty hypercubes
- Edge-fault-tolerant bipanconnectivity of hypercubes
- The bipancycle-connectivity of the hypercube
- Long paths in hypercubes with conditional node-faults
- A survey of the theory of hypercube graphs
- Spanning multi-paths in hypercubes
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Edge-bipancyclicity of conditional faulty hypercubes
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- On the equitable \(k^{*}\)-laceability of hypercubes
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
This page was built for publication: Many-to-many disjoint paths in faulty hypercubes