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

Partition theory studies the ways in which a positive integer can be expressed as a sum of positive integers, without regard to order. Originating in the work of Euler, it has evolved through the ...