We present a fully polynomial-time approximation scheme for a multicommodity flow problem that yields lower bounds of the graph bisection problem. We compare the approximation algorithm with Lagrangian relaxation based cost-decomposition approaches and linear programming software when embedded in an exact branch&bound approach for graph bisection. It is shown that the approximation algorithm is...

Line bisection is an established clinical task used to diagnose visuospatial neglect. To date, few studies have considered the extent to which age and sex as background variables contribute to bisection performance. Both variables affect the neural substrates underlying cognitive processes and hence the behavioural performance of bisection. The purpose of this study was to examine the effects o...

A recent study has shown that congenitally blind adults, who have never had visual experience, are impaired on an auditory spatial bisection task (Gori, Sandini, Martinoli, & Burr, 2014). In this study we investigated how thresholds for auditory spatial bisection and auditory discrimination develop with age in sighted and congenitally blind children (9 to 14 years old). Children performed 2 spa...

A new hybrid genetic algorithm for graph bisection is proposed. The algorithm includes a new local optimization heuristic. Based on the traditional framework of the KernighanLin algorithm, the local optimization uses a new type of gain as the primary measure for vertex movement. The new algorithm showed signi cant or dramatic improvement over the state-of-the-art algorithms.

The number bisection tasks, whereby participants estimate the midpoint of a given number interval, is frequently used to explore the idea that numbers are spatially represented within the brain across a 'mental number line'. Some neuropsychological research supports the argument that number bisection is a spatial task, recruiting parietal brain regions, whereas other data suggest that number bi...

The most commonly used p-way partitioning method is recursive bisection (RB). It first divides a graph or a mesh into two equal-sized pieces, by a “good” bisection algorithm, and then recursively divides the two pieces. Ideally, we would like to use an optimal bisection algorithm. Because the optimal bisection problem that partitions a graph into two equal-sized subgraphs to minimize the number...

Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as the number of edges between these two sets. We first consider this problem for trees and prove that the minimum bisection width of every tree T on n vertices satisfies MinBis(T ) ≤ 8n∆(T )/ diam(T ). Second, we general...

In roving-referent bisection, three duration values are presented sequentially on each trial, two referents and then a probe, and the observer is instructed to indicate whether the probe is more similar to the duration of the first or second trial referent. Data from three experiments are reported which consistently indicate that human observers do not compare the probe to the trial referents i...