An Upper Bound for the Bisection Width of a Diagonal Mesh

Authors:
K. Wendy Tang;Ridha Kamoua
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
2007

Citing 2
Cited 1

Diagonal and Toroidal Mesh Networks

IEEE Transactions on Computers
A counterexample to Tang and Padubidri's claim about the bisection width of a diagonal mesh

IEEE Transactions on Computers

Orthogonal drawings and crossing numbers of the Kronecker product of two cycles

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	14.98

Visualization

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