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

Graph partitioning is an optimization problem with the aim of dividing a large geographical network into manageable size districts called sub-networks with less complexity in favor of balancing the ...