Publication
BIT
Paper

On the complexity of partitioning sparse matrix representations

View publication

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.

Date

01 Mar 1984

Publication

BIT

Authors

Topics

Share