Bandwidth reduction in rectalgular grids

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages, 1 figutre

Keywords

Combinatorics, 05C78

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/67577

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0305365
 http://arxiv.org/abs/math/0305365

Collections

arXiv