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

Seher AcerEnver KayaaslanCevdet Aykanat
Published in: SIAM J. Sci. Comput. (2013)
Keyphrases
  • dynamic programming
  • block diagonal
  • optimal solution
  • search space
  • learning algorithm
  • worst case
  • objective function
  • computational complexity
  • k means
  • np hard
  • linear programming
  • convergence rate
  • linear systems