Set-to-set disjoint paths in a folded hypercube
From MaRDI portal
Publication:6495788
DOI10.1016/J.TCS.2024.114562MaRDI QIDQ6495788
Keiichi Kaneko, Hiroyuki Ichida
Publication date: 2 May 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Node-to-set disjoint paths problem in star graphs
- An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs
- One-to-many node-disjoint paths of hyper-star networks
- One-to-many node-disjoint paths in \((n,k)\)-star graphs
- The \((n,k)\)-star graph: A generalized star graph
- An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
- Conditional connectivity of folded hypercubes
- On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes
- Cycles in folded hypercubes with two adjacent faulty vertices
- Node-disjoint paths in hierarchical hypercube networks
- An efficient construction of one-to-many node-disjoint paths in folded hypercubes
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
- DISJOINT-PATHS AND FAULT-TOLERANT ROUTING ON RECURSIVE DUAL-NET
- A group-theoretic model for symmetric interconnection networks
- The Mobius cubes
- Complete binary trees in folded and enhanced cubes
- Node‐disjoint paths and related problems on hierarchical cubic networks
- Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements
This page was built for publication: Set-to-set disjoint paths in a folded hypercube
