The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
From MaRDI portal
Publication:2118871
DOI10.1016/J.TCS.2022.02.003OpenAlexW4213300919MaRDI QIDQ2118871
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.003
Related Items (4)
The disjoint path cover in the data center network HSDC with prescribed vertices in each path ⋮ Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges ⋮ Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults ⋮ One-to-one disjoint-path covers of leaf-sort graphs
Cites Work
- Two node-disjoint paths in balanced hypercubes
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs
- Paired many-to-many disjoint path covers in faulty hypercubes
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
- Many-to-many disjoint paths in faulty hypercubes
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
- On the spanning connectivity and spanning laceability of hypercube-like networks
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- Fault diagnosability of bicube networks under the PMC diagnostic model
- Hamiltonian properties on the class of hypercube-like networks
- The bipanconnectivity of bipartite hypercube-like networks
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- On Path Cover Problems in Digraphs and Applications to Program Testing
- The Mobius cubes
- The bicube: an interconnection of two hypercubes
This page was built for publication: The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
