A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout

DOI10.1016/J.DAM.2018.06.039MaRDI QIDQ2201764zbMATH OpenOpenAlexFDO

Authors Arul Jeya Shalini, Jessie Abraham, 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

zbMATH Keywords

gridembeddinglayoutlocally twisted cubeoptimal set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Paths and cycles (05C38)

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

• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• 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
• 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

(10)

• On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
• On linear layout of bicube and construction of optimal incomplete bicube
• The generalized 4-connectivity of locally twisted cubes
• An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
• Embedding mutually edge-disjoint cycles into locally twisted cubes
• Characterization of the congestion lemma on layout computation
• Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelength
• Wiener index via wirelength of an embedding
• Embedding algorithm of spined cube into grid structure and its wirelength computation
• Layout of embedding locally twisted cube into the extended theta mesh topology

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)