Minimum wirelength of hypercubes into n-dimensional grid networks
From MaRDI portal
(Redirected from Publication:436612)
Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
Recommendations
Cites work
Cited in
(15)- Node set optimization problem for complete Josephus cubes
- Graph Drawing
- Conjectures on wirelength of hypercube into cylinder and torus
- Linear wirelength of folded hypercubes
- A linear time algorithm for embedding hypercube into cylinder and torus
- Optimal embedding of locally twisted cubes into grids
- Embedding Wheel - like Networks
- Exact wirelength of hypercubes on a grid
- Optimal embedding of hypercube into cylinder
- An asymptotic relation between the wirelength of an embedding and the Wiener index
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles
- Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength
- 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
This page was built for publication: Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436612)