arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0305365math.CO
收藏

矩形网格中的带宽缩减

Bandwidth reduction in rectalgular grids

Titu Andreescu, Walter Stromquist, Zoran Sunik

摘要:

我们表明,一个正方形的任意大小的二维网格的带宽可以减少,如果两个(但不小于两个)的边缘被删除。两个删除的边不能任意选择,但它们可以选择为共享公共端点或不相邻。我们还表明,矩形n × m(m大于或等于n)网格的带宽可以减少k,对于所有的k是足够小的,如果m-n+2k边缘被删除。

英文摘要:

We show that the bandwidth of a square two-dimensional grid of arbitrary size can be reduced if two (but not less than two) edges are deleted. The two deleted edges may not be chosen arbitrarily, but they may be chosen to share a common endpoint or to be non-adjacent. We also show that the bandwidth of the rectangular n by m (m greater or equal to n) grid can be reduced by k, for all k that are sufficiently small, if m-n+2k edges are deleted.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑