 We empirically demonstrate that all of our algorithms efficiently produce high-quality contiguous partitions  .
<meaning-changed>  We empirically demonstrate that all of our algorithms efficiently produce high-quality contiguous partitions  .
 We empirically demonstrate that all of our algorithms efficiently produce high-quality contiguous partitions on a test suite of 42 test matrices. When K = 8, our hypergraph connectivity partitioner achieved a speedup of 53\times (mean 15.1\times) over prior algorithms. The mean runtime of our bottleneck partitioner was 5.15 SpMVs .