Recommendations
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
- A linear time algorithm for embedding hypercube into cylinder and torus
- Exact wirelength of hypercubes on a grid
- Conjectures on wirelength of hypercube into cylinder and torus
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 2060183 (Why is no real title available?)
- scientific article; zbMATH DE number 975387 (Why is no real title available?)
- An edge-isoperimetric problem for powers of the Petersen graph
- Embedding ladders and caterpillars into the hypercube
- Exact wirelength of hypercubes on a grid
- On reliability of the folded hypercubes
- The congestion of \(n\)-cube layout on a rectangular grid
Cited in
(19)- On linear layout of bicube and construction of optimal incomplete bicube
- Node set optimization problem for complete Josephus cubes
- Conjectures on wirelength of hypercube into cylinder and torus
- Reliability measure of multiprocessor system based on enhanced hypercubes
- A linear time algorithm for embedding hypercube into cylinder and torus
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
- A note on minimum linear arrangement for BC graphs
- Minimum linear arrangement of the Cartesian product of optimal order graph and path
- Optimal embedding of locally twisted cubes into grids
- Embedding of the folded hypercubes into tori
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- Linear layout of locally twisted cubes
- Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
- Embedding of hypercubes into sibling trees
- Embedding algorithm of spined cube into grid structure and its wirelength computation
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity
This page was built for publication: Linear wirelength of folded hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691637)
