Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
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
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998