Bisection problems, in particular, focus on the nearly equal division of a graph and are closely linked to studies in spectral graph theory and approximation algorithms.

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 ...