Minimum wirelength of hypercubes into n-dimensional grid networks

DOI10.1016/J.IPL.2012.04.008zbMATH Open1243.05127OpenAlexW2007703289MaRDI QIDQ436612FDOQ436612

Indra Rajasingh, Paul Manuel, Bharati Rajan, Micheal Arockiaraj

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

zbMATH Keywords

embeddingcongestionparallel processingwirelength

Mathematics Subject Classification ID

Paths and cycles (05C38) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Title not available (Why is that?)
• Exact wirelength of hypercubes on a grid

Cited In (12)

• Graph Drawing
• Node set optimization problem for complete Josephus cubes
• A linear time algorithm for embedding hypercube into cylinder and torus
• Embedding Wheel - like Networks
• Optimal embedding of hypercube into cylinder
• 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 Locally Twisted Cubes into Grids
• Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength
• Embedding algorithm of spined cube into grid structure and its wirelength computation
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout

This page was built for publication: Minimum wirelength of hypercubes into \(n\)-dimensional grid networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436612)