The antibandwidth problem is to label vertices of a graph G = (V, E) bijectively by 0, 1, 2,..., | V | - 1 so that the minimal difference of labels of adjacent vertices is maximised. In this paper we prove an almost exact result for the antibandwidth of three-dimensional meshes. Provided results are extensions of the two-dimensional case and an analogue of the result for the bandwidth of three-dimensional meshes obtained by FitzGerald.
展开▼
机译：反带宽问题是用0、1、2，...，|双射地标记图的顶点G =（V，E）。 V | -1，以使相邻顶点的标签的最小差异最大。在本文中，我们证明了三维网格抗带宽的几乎准确的结果。提供的结果是二维情况的扩展，以及FitzGerald获得的三维网格带宽结果的类似物。
展开▼
