Optimal Embedding of Locally Twisted Cubes into Grids
From MaRDI portal
Publication:2971629
DOI10.1007/978-3-319-53007-9_1zbMath1430.68168OpenAlexW2585703357MaRDI QIDQ2971629
Micheal Arockiaraj, Jessie Abraham
Publication date: 7 April 2017
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_1
Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
- Bothway embedding of circulant network into grid
- Linear wirelength of folded hypercubes
- A framework for solving VLSI graph layout problems
- Embedding meshes into locally twisted cubes
- Exact wirelength of hypercubes on a grid
- Algorithms for drawing graphs: An annotated bibliography
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- The congestion of \(n\)-cube layout on a rectangular grid
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- The locally twisted cubes
- Crossing Numbers and Cutwidths
- Optimal Assignments of Numbers to Vertices
- Linear layout of locally twisted cubes
