A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap

Seher Acer, Enver Kayaaslan, Cevdet Aykanat. A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap. SIAM J. Scientific Computing, 35(1), 2013. [doi]

@article{AcerKA13,
  title = {A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap},
  author = {Seher Acer and Enver Kayaaslan and Cevdet Aykanat},
  year = {2013},
  doi = {10.1137/120861242},
  url = {http://dx.doi.org/10.1137/120861242},
  researchr = {https://researchr.org/publication/AcerKA13},
  cites = {0},
  citedby = {0},
  journal = {SIAM J. Scientific Computing},
  volume = {35},
  number = {1},
}