An upper bound for the bisection width of a diagonal mesh

K. Wendy Tang; Ridha Kamoua

doi:10.1109/TC.2007.40

An upper bound for the bisection width of a diagonal mesh

Electrical Engineering

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

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).

Original language	English
Pages (from-to)	429-431
Number of pages	3
Journal	IEEE Transactions on Computers
Volume	56
Issue number	3
DOIs	https://doi.org/10.1109/TC.2007.40
State	Published - Mar 2007

Keywords

Architectures
Network topologies

Access to Document

10.1109/TC.2007.40

Cite this

@article{84b73990263e44e59b3f84e4834b44ac,

title = "An upper bound for the bisection width of a diagonal mesh",

abstract = "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).",

keywords = "Architectures, Network topologies",

author = "Tang, \{K. Wendy\} and Ridha Kamoua",

year = "2007",

month = mar,

doi = "10.1109/TC.2007.40",

language = "English",

volume = "56",

pages = "429--431",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

number = "3",

}

TY - JOUR

T1 - An upper bound for the bisection width of a diagonal mesh

AU - Tang, K. Wendy

AU - Kamoua, Ridha

PY - 2007/3

Y1 - 2007/3

N2 - 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).

AB - 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).

KW - Architectures

KW - Network topologies

UR - https://www.scopus.com/pages/publications/33947416552

U2 - 10.1109/TC.2007.40

DO - 10.1109/TC.2007.40

M3 - Article

AN - SCOPUS:33947416552

SN - 0018-9340

VL - 56

SP - 429

EP - 431

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 3

ER -

An upper bound for the bisection width of a diagonal mesh

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this