Bandwidth reduction in rectalgular grids

Simple item page
dc.creatorAndreescu, Titu
dc.creatorStromquist, Walter
dc.creatorSunik, Zoran
dc.date2003-05-26
dc.date.accessioned2026-07-07T04:58:17Z
dc.date.available2026-07-07T04:58:17Z
dc.descriptionWe 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.
dc.description9 pages, 1 figutre
dc.identifierhttps://arxiv.org/abs/math/0305365
dc.identifierhttp://arxiv.org/abs/math/0305365
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67577
dc.subjectCombinatorics
dc.subject05C78
dc.titleBandwidth reduction in rectalgular grids
dc.typetext

Files

Collections

arXiv