Bandwidth reduction in rectangular grids
We show that the bandwidth of a square twodimensional 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 bandwi...
Saved in:
| Date: | 2007 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2007
|
| Series: | Algebra and Discrete Mathematics |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/157342 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Bandwidth reduction in rectangular grids / T. Andreescu, W. Stromquist, Z. Sunic // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 2. — С. 1–15. — Бібліогр.: 3 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Summary: | We show that the bandwidth of a square twodimensional 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. |
|---|