On the complexity of partitioning sparse matrix representations (Q786530)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of partitioning sparse matrix representations |
scientific article; zbMATH DE number 3839316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of partitioning sparse matrix representations |
scientific article; zbMATH DE number 3839316 |
Statements
On the complexity of partitioning sparse matrix representations (English)
0 references
1984
0 references
24, 60-68 (1984)
0 references
graph partitioning
0 references
NP-completeness
0 references
data structures
0 references
