This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Upper Bound for the Bisection Width of a Diagonal Mesh
March 2007 (vol. 56 no. 3)
pp. 429-431
ASCII Text
x 
 
K. Wendy Tang, Ridha Kamoua, "An Upper Bound for the Bisection Width of a Diagonal Mesh," IEEE Transactions on Computers, vol. 56, no. 3, pp. 429-431, March, 2007.
 
 
BibTex
x
 
@article{ 10.1109/TC.2007.40,
author = {K. Wendy Tang and Ridha Kamoua},
title = {An Upper Bound for the Bisection Width of a Diagonal Mesh},
journal ={IEEE Transactions on Computers},
volume = {56},
number = {3},
issn = {0018-9340},
year = {2007},
pages = {429-431},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.40},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - An Upper Bound for the Bisection Width of a Diagonal Mesh
IS - 3
SN - 0018-9340
SP429
EP431
EPD - 429-431
A1 - K. Wendy Tang,
A1 - Ridha Kamoua,
PY - 2007
KW - Network topologies
KW - architectures.
VL - 56
JA - IEEE Transactions on Computers
ER -
 
Recently, it was correctly pointed out by Jha that there is an error in our earlier paper on diagonal mesh networks. In response to Jha's critique, we now provide an upper bound on the bisection width of a diagonal mesh. The proof is a constructive one and an algorithm is provided to divide the network into two equal halves (plus/minus one node).
Index Terms:
Network topologies, architectures.
Citation:
K. Wendy Tang, Ridha Kamoua, "An Upper Bound for the Bisection Width of a Diagonal Mesh," IEEE Transactions on Computers, vol. 56, no. 3, pp. 429-431, March 2007, doi:10.1109/TC.2007.40
Usage of this product signifies your acceptance of the Terms of Use.