This is a preview. Log in through your library . Abstract A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of ...

Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into distinct ...

The probabilistic bisection algorithm (PBA) solves a class of stochastic rootfinding problems in one dimension by successively updating a prior belief on the location of the root based on noisy ...