Bandwidth reduction in rectangular grids
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...
Gespeichert in:
| Datum: | 2018 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Lugansk National Taras Shevchenko University
2018
|
| Schlagworte: | |
| Online Zugang: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/839 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete Mathematics| id |
oai:ojs.admjournal.luguniv.edu.ua:article-839 |
|---|---|
| record_format |
ojs |
| spelling |
oai:ojs.admjournal.luguniv.edu.ua:article-8392018-03-21T11:59:09Z Bandwidth reduction in rectangular grids Andreescu, Titu Stromquist, Water Sunic, Zoran linear bandwidth, rectangular grid 05C78 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 \times m\) (\(n \leq m\)) grid can be reduced by \(k\), for all \(k\) that are sufficiently small, if \(m-n+2k\) edges are deleted. Lugansk National Taras Shevchenko University 2018-03-21 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/839 Algebra and Discrete Mathematics; Vol 6, No 2 (2007) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/839/370 Copyright (c) 2018 Algebra and Discrete Mathematics |
| institution |
Algebra and Discrete Mathematics |
| baseUrl_str |
|
| datestamp_date |
2018-03-21T11:59:09Z |
| collection |
OJS |
| language |
English |
| topic |
linear bandwidth rectangular grid 05C78 |
| spellingShingle |
linear bandwidth rectangular grid 05C78 Andreescu, Titu Stromquist, Water Sunic, Zoran Bandwidth reduction in rectangular grids |
| topic_facet |
linear bandwidth rectangular grid 05C78 |
| format |
Article |
| author |
Andreescu, Titu Stromquist, Water Sunic, Zoran |
| author_facet |
Andreescu, Titu Stromquist, Water Sunic, Zoran |
| author_sort |
Andreescu, Titu |
| title |
Bandwidth reduction in rectangular grids |
| title_short |
Bandwidth reduction in rectangular grids |
| title_full |
Bandwidth reduction in rectangular grids |
| title_fullStr |
Bandwidth reduction in rectangular grids |
| title_full_unstemmed |
Bandwidth reduction in rectangular grids |
| title_sort |
bandwidth reduction in rectangular grids |
| 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 \times m\) (\(n \leq m\)) grid can be reduced by \(k\), for all \(k\) that are sufficiently small, if \(m-n+2k\) edges are deleted. |
| publisher |
Lugansk National Taras Shevchenko University |
| publishDate |
2018 |
| url |
https://admjournal.luguniv.edu.ua/index.php/adm/article/view/839 |
| work_keys_str_mv |
AT andreescutitu bandwidthreductioninrectangulargrids AT stromquistwater bandwidthreductioninrectangulargrids AT suniczoran bandwidthreductioninrectangulargrids |
| first_indexed |
2025-07-17T10:36:39Z |
| last_indexed |
2025-07-17T10:36:39Z |
| _version_ |
1837890116330192896 |