Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Paper
On the complexity of partitioning sparse matrix representations
Abstract
A standard representation of a sparse matrix is a structure where non-zero elements are linked in rows and columns. A general graph structure corresponding to this representation is defined. The problem of partitioning such a graph into fixed size blocks, so that the number of inter-block links is minimized, is shown to be NP-complete. © 1984 BIT Foundations.
Related
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022