An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polynomial time. We base this on a proof of an upper bound of n on the bisection width for 4-connected pl...

By using a deck of cards, it is possible to realize a secure computation. In particular, since a new shuffling operation, called a random bisection cut, was devised in 2009, many efficient protocols have been designed. The shuffle functions in the following manner. A sequence of cards is bisected, and the two halves are swapped randomly. This results in two possible cases, depending on whether ...

Continuous subjective bisection of a right angle rotating through 360° in a frontal plane was performed by 10 Ss using the Be'ke'sy technique. The largest and most consistent constant errors in bisection, ranging up to 10°, occurred in upper-right and upper-left quadrants. Interindividual and interquadrant differences indicate that the constant errors cannot be attributed solely to the effect o...

Bisection tasks are commonly used to assess biases and asymmetries in visuospatial attention both patients neurologically intact individuals. In these tasks, participants usually asked identify the midpoint manually bisect a horizontal line. Typically, healthy individuals tend show an processing advantage for left visual field, known as “pseudoneglect.” Here, performance at two computerized ver...

We prove that if ( min ⁡ , + ) - Convolution can be solved in O τ n time, then Bisection on treewidth t graphs time 8 1 log ⋅ assuming a decomposition of width as input. Plugging the 2 algorithm for yields . This improves over (dependence the) 3 Jansen et al. [SICOMP 2005] at cost worse dependence “Conversely”, we show β edge weighted trees, so Thus, obtaining sub-quadratic trees is extremely c...

Recent studies have suggested that numerical and physical magnitudes are similarly processed by a generalized magnitude system. The present study investigates the number-luminance interaction, taking advantage of illusory effects in a cued line bisection task with numerical or nonnumerical flankers and varying levels of luminance. The results showed that both dimensions influenced bisection per...

Numerical experiments in J. Maubach, Local bisection refinement and optimal order algebraic multilevel preconditioners, PRISM-97 conference Proceedings (eds. O. Axelsson et al), University of Nijmegen, the Netherlands, 1997, 121-136 indicated that the refinement with the use of local bisections presented in J. Maubach, Local bisection refinement for n-simplicial grids generated by reflections, ...

We studied the effects of transcutaneous electrical nerve stimulation (TENS) in six right-brain-damaged patients with left unilateral spatial neglect (USN), using both standard clinical tests (reading, line, and letter cancelation, and line bisection), and electrophysiological measures (steady-state visual-evoked potentials, SSVEP). TENS was applied on left neck muscles for 15', and measures we...