Bandwidth reduction in rectalgular grids

Details Bandwidth reduction in rectalgular grids Bandwidth reduction in rectalgular grids

2003-05-26

arxiv.org/abs/math/0305365v1

Mathematics

Combinatorics

9 pages, 1 figutre

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bandwidth reduction in rectalgular grids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bandwidth reduction in rectalgular grids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bandwidth reduction in rectalgular grids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-458204