Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
From MaRDI portal
Publication:436612
DOI10.1016/J.IPL.2012.04.008zbMath1243.05127OpenAlexW2007703289MaRDI QIDQ436612
Indra Rajasingh, Micheal Arockiaraj, Paul D. Manuel, Bharathi Rajan
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.008
Paths and cycles (05C38) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Related Items (10)
An asymptotic relation between the wirelength of an embedding and the Wiener index ⋮ Embedding complete multi-partite graphs into Cartesian product of paths and cycles ⋮ Optimal embedding of hypercube into cylinder ⋮ Embedding Wheel - like Networks ⋮ A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout ⋮ Optimal Embedding of Locally Twisted Cubes into Grids ⋮ Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees ⋮ A linear time algorithm for embedding hypercube into cylinder and torus ⋮ Node set optimization problem for complete Josephus cubes ⋮ Embedding algorithm of spined cube into grid structure and its wirelength computation
Cites Work
This page was built for publication: Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
