Bandwidth Reduction In Rectangular Grids
Document Type
Article
Publication Date
2007
Published In
Algebra And Discrete Mathematics
Abstract
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×m (n≤m) grid can be reduced by k, for all k that are sufficiently small, if m-n+2k edges are deleted.
Recommended Citation
T. Andreescu, Walter Stromquist, and Z. Ŝunić.
(2007).
"Bandwidth Reduction In Rectangular Grids".
Algebra And Discrete Mathematics.
Issue 2.
1-15.
https://works.swarthmore.edu/fac-math-stat/34