A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
From MaRDI portal
Publication:2201764
DOI10.1016/j.dam.2018.06.039zbMath1447.05070OpenAlexW2888998575MaRDI QIDQ2201764
Jessie Abraham, Arul Jeya Shalini, Micheal Arockiaraj
Publication date: 17 September 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.039
Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Wiener index via wirelength of an embedding, Embedding mutually edge-disjoint cycles into locally twisted cubes, 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, On the optimal layout of balanced complete multipartite graphs into grids and tree related structures, Embedding algorithm of spined cube into grid structure and its wirelength computation
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