Bandwidth reduction in rectangular grids

dc.contributor.author	Andreescu, T.
dc.contributor.author	Stromquist, W.
dc.contributor.author	Sunic, Z.
dc.date.accessioned	2019-06-20T02:42:05Z
dc.date.available	2019-06-20T02:42:05Z
dc.date.issued	2007
dc.identifier.citation	Bandwidth reduction in rectangular grids / T. Andreescu, W. Stromquist, Z. Sunic // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 2. — С. 1–15. — Бібліогр.: 3 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2000 Mathematics Subject Classification: 05C78.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/157342
dc.description.abstract	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.	uk_UA
dc.description.sponsorship	The third author was partially supported by NSF grant DMS-0600975	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Bandwidth reduction in rectangular grids	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA