A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
From MaRDI portal
(Redirected from Publication:2201764)
Recommendations
- Layout of embedding locally twisted cube into the extended theta mesh topology
- Optimal embedding of locally twisted cubes into grids
- Linear layout of locally twisted cubes
- A novel algorithm to embed a multi-dimensional torus into a locally twisted cube
- Minimum layout of circulant graphs into certain height balanced trees
Cites work
- A framework for solving VLSI graph layout problems
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Algorithms for drawing graphs: An annotated bibliography
- Bothway embedding of circulant network into grid
- Crossing Numbers and Cutwidths
- Embedding meshes into locally twisted cubes
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- Exact wirelength of hypercubes on a grid
- scientific article; zbMATH DE number 2060183 (Why is no real title available?)
- Linear layout of locally twisted cubes
- Linear wirelength of folded hypercubes
- 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 locally twisted cubes
Cited in
(11)- Characterization of the congestion lemma on layout computation
- Embedding algorithm of spined cube into grid structure and its wirelength computation
- Embedding mutually edge-disjoint cycles into locally twisted cubes
- On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
- Layout of embedding locally twisted cube into the extended theta mesh topology
- Wiener index via wirelength of an embedding
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
- The generalized 4-connectivity of locally twisted cubes
- On linear layout of bicube and construction of optimal incomplete bicube
- Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelength
- An upper bound for edge congestion and the exact wirelength of embedding onto BC graphs
This page was built for publication: A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201764)