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

Abstract: For accelerating the convergence of numerical computation of sparse matrices, the classical approach is to partition sparse matrices into block-diagonal structures by graph partitioning ...

The problem considered in this paper is that of partitioning a link-weighted graph G into two parts, each of which is constrained in size by the (given) maximum number of vertices that the part can ...