Bandwidth reduction in rectangular grids
Vernadsky National Library of Ukraine
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
Bandwidth reduction in rectangular grids
|
|
| Creator |
Andreescu, T.
Stromquist, W. Sunic, Z. |
|
| Description |
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. |
|
| Date |
2019-06-20T02:42:05Z
2019-06-20T02:42:05Z 2007 |
|
| Type |
Article
|
|
| Identifier |
Bandwidth reduction in rectangular grids / T. Andreescu, W. Stromquist, Z. Sunic // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 2. — С. 1–15. — Бібліогр.: 3 назв. — англ.
1726-3255 2000 Mathematics Subject Classification: 05C78. http://dspace.nbuv.gov.ua/handle/123456789/157342 |
|
| Language |
en
|
|
| Relation |
Algebra and Discrete Mathematics
|
|
| Publisher |
Інститут прикладної математики і механіки НАН України
|
|