Routing permutations and 2-1 routing requests in the hypercube
From MaRDI portal
Recommendations
Cites work
- Counterexample to a conjecture of Szymanski on hypercube routing
- scientific article; zbMATH DE number 1420909 (Why is no real title available?)
- Rearrangeable circuit-switched hypercube architectures for routing permutations
- Routing a permutation in the hypercube by two sets of edge disjoint paths
- Routings for involutions of a hypercube
Cited in
(10)- Symmetric routings of the hypercube
- Routing a permutation in the hypercube by two sets of edge disjoint paths
- Oblivious routing for LC permutations on hypercubes.
- Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem
- Routing linear permutations on Fibonacci and Lucas cubes
- 2-1 routing requests in the hypercube
- scientific article; zbMATH DE number 1420909 (Why is no real title available?)
- scientific article; zbMATH DE number 5233147 (Why is no real title available?)
- A d-move local permutation routing for the d-cube
- Counterexample to a conjecture of Szymanski on hypercube routing
This page was built for publication: Routing permutations and 2-1 routing requests in the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948960)