Bandwidth reduction in rectangular grids

Завантаження...
Ескіз

Дата

Назва журналу

Номер ISSN

Назва тому

Видавець

Інститут прикладної математики і механіки НАН України

Анотація

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.

Опис

Теми

Цитування

Bandwidth reduction in rectangular grids / T. Andreescu, W. Stromquist, Z. Sunic // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 2. — С. 1–15. — Бібліогр.: 3 назв. — англ.

item.page.endorsement

item.page.review

item.page.supplemented

item.page.referenced