In this paper we consider the three-dimensional layout of hypercube networks. Namely, we study the problem of laying hypercube networks out on the three-dimensional grid with the properties that all nodes are represented as rectangular slices and lie on two opposite sides of the bounding box of the layout volume. We present both a lower bound and a layout method providing an upper bound on the layout volume of the hypercube network. © Springer-Verlag 2004.
CITATION STYLE
Calamoneri, T., & Massini, A. (2004). Nearly Optimal Three Dimensional Layout of Hypercube Networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 247–258. https://doi.org/10.1007/978-3-540-24595-7_23
Mendeley helps you to discover research relevant for your work.