The linear layout problem is to find an arrangement of vertices of the given graph, which minimizes various cost measures. The min-sum problem is to find a layout that minimizes the sum of edge lengths. The min-cut problem is to find a layout which minimizes the maximum edge density. The bandwidth problem is to find a layout which minimizes the maximum edge density. The bandwidth problem is to minimize the longest edge length. And the min-cross problem is to find a layout with minimum number of pairwise intersections of edges. So far there have been lots of researches on these problems and some results for hypercubes can be found. We consider the layout of hypercubes and show a upper bound for the min-cross problem.
All linear layout problems can be extended to 2-dimensional and circular cases, which are more meaningful in applications. We consider the min-sum, min-cut, bandwidth, and min-cross problems in 2-dimensional layout. For circular layout we show a upper bound for each problem. All these results have many applications especially in the area of VLSI layout design.