Abstract
The sparse matrix partitioning problem arises when minimizing communication in parallel sparse matrix vector multiplications. Since the problem is NP-hard, heuristics are usually employed to find solutions. Here, we present a purely combinatorial branch-and-bound method for computing optimal bipartitionings of sparse matrices, in the sense that they have the lowest
... read more