Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
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.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Jianke Yang, Robin Walters, et al.
ICML 2023
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Naga Ayachitula, Melissa Buco, et al.
SCC 2007