论文部分内容阅读
设G是一个简单图.二维带宽问题是:确定图G在平面格子上的一个嵌入,使得最长边尽可能短.本文给出了一些特殊图类的二维带宽.“,”Let G be a simple graph. The two dimensional bandwidth problem is to determine an embedding of graph G in a grid graph in the plane such that the longest edges are as short as possible. This paper gives the two dimensional bandwidth of some special graphs.