Embedding algorithm of spined cube into grid structure and its wirelength computation
From MaRDI portal
Recommendations
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- Graph embedding and interconnection networks
- Embedding of recursive circulants into certain necklace graphs
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles
Cites work
- scientific article; zbMATH DE number 2060183 (Why is no real title available?)
- A framework for solving VLSI graph layout problems
- A hypercube variant with small diameter
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- A note about some properties of BC graphs
- A note on minimum linear arrangement for BC graphs
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- An edge-isoperimetric problem for powers of the Petersen graph
- Bothway embedding of circulant network into grid
- Exact wirelength of hypercubes on a grid
- Linear wirelength of folded hypercubes
- Maximum number of edges joining vertices on a cube
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
- Optimal Assignments of Numbers to Vertices
- The congestion of \(n\)-cube layout on a rectangular grid
- The spined cube: a new hypercube variant with smaller diameter
- Wirelength of embedding complete multipartite graphs into certain graphs
Cited in
(3)
This page was built for publication: Embedding algorithm of spined cube into grid structure and its wirelength computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2072078)