Nearly Optimal Three Dimensional Layout of Hypercube Networks

Calamoneri, Tiziana and Massini, Annalisa (2004) Nearly Optimal Three Dimensional Layout of Hypercube Networks. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 247-258(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_23).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-24595-7_23
Classifications: G Algorithms and Complexity > G.070 Area / Edge Length
P Styles > P.060 3D
P Styles > P.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/532

Actions (login required)

View Item View Item