IMDEA Networks Institute Publications Repository

Bisection Width of Multidimensional Product Graphs

Arjona Aroca, Jordi and Fernández Anta, Antonio (2011) Bisection Width of Multidimensional Product Graphs. In: Young Researchers Forum (YRF 2011), The 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), 22 -26 August 2011, Warsaw, Poland.

PDF (Bisection Width of Multidimensional Product Graphs) - Published Version
Download (95Kb) | Preview


In this paper we will provide two general results that allow to obtain upper and lower bounds on the bisection width of a product graph as a function of some properties of its factor graphs. The most interesting contribution of this paper is the exact value of the bisection width of a d-dimensional torus, as this problem has been open for almost 20 years [2]. Our work is partially based on the work by Azizo�glu and E�gecio�glu. In [1] they study the relation between the isoperimetric number and the bisection width of diff�erent product networks and obtained and exact value for the bisection width of the d-dimensional array studying it as a product of paths. Similarly, we have been able to provide a lower and an upper bound for the bisection width of product graphs whose factor graphs have the same maximal congestion with multiplicity r, for the former case, or the same central cut, for the latter one. The general results provided are used to obtain exact bounds on the bisection width of several product graphs. The factor graphs used are paths, rings, complete binary trees (CBTs), and extended trees (which are CBTs with the leaves connected as a path). Then, we show that the Cartesian product of rings (i.e., the torus) of sizes k1 � : : : � kd has bisection width 2 Pei =1 Ci, where Ci = Qdj =i+1 kj for i 2 [1; e], and e being the lowest dimension with an even number of vertices. (If there is no such dimension, e = d.). Additionally, we show that the Cartesian product of a mixture of XTs and rings has the same bisection width. (When all factor graphs are XTs, e = d.) Finally, we show that the Cartesian product of a mixture of CBTs and paths has bisection width Pei =1 Ci. (When all factor graphs are CBTs, e = d.)

Item Type: Conference or Workshop Papers (Paper)
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > T Technology (General)
T Technology > TA Engineering (General). Civil engineering (General)
T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
Depositing User: Rebeca De Miguel
Date Deposited: 18 May 2012 15:47
Last Modified: 15 Dec 2016 11:39

Actions (login required)

View Item View Item