Graph partitioning and bisection represent fundamental questions in combinatorial optimisation, concerned with dividing the vertices of a graph into disjoint subsets while balancing size constraints ...