The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal number of vertices, and the weight of the edge cut is maximal. This work introduces a connected multidimensional generalization of the maximum bisection prob...

Mamassian and de Montalembert (2010) have proposed a simple model of the vertical-horizontal illusion. This model identified two components, an anisotropy which results in horizontal lines being perceived approximately 6% shorter than verticals and a bisection component which results in a bisected line being perceived approximately 16% shorter. We have shown that this bisection component confou...

We prove lower and upper bounds on bisection widths of the transposition graphs. This class of graphs contains several frequently studied intercon-nection networks including star graphs and hypercubes. In particular, we prove that the bisection width of the complete transposition graph is of order (n:n!) which solves the open problem (R) 3.356 of the Leighton's book 10] and determine nearly exa...

This paper proves tight bounds on the bisection width and expansion of butter y networks with and without wraparound. We show that the bisection width of an n-input butter y network is 2(p2 1)n+ o(n) :82n without wraparound, and n with wraparound. The former result is surprising, since it contradicts the prior \folklore" belief that the bisection width was n. We also show that every set of k no...

The present study investigated the effects of left hemispatial neglect on two tasks activating the mental number line (MNL). Six patients with left neglect performed a mental number bisection task and a modified version of the Spatial Numerical Association of Response Codes (SNARC) task. Effects of left neglect were observed in the number bisection task, but not in the SNARC task. We argue that...