On the Complexity of Partitioning Sparse Matrix Representations

Simple item page
dc.contributor.authorRobertson, Edward; Malmquist, J.
dc.date.accessioned2025-10-21T17:07:58Z
dc.date.available2025-10-21T17:07:58Z
dc.date.issued1984-01
dc.description.abstractA 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.
dc.identifier.urihttps://hdl.handle.net/2022/33944
dc.relation.ispartofseriesIndiana University Computer Science Technical Reports; TR144
dc.rightsThis work is protected by copyright unless stated otherwise.
dc.rights.uri
dc.titleOn the Complexity of Partitioning Sparse Matrix Representations

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR144.pdf
Size:
23.09 KB
Format:
Adobe Portable Document Format
Download

Collections

Technical Reports
Can’t use the file because of accessibility barriers? Contact us