On the complexity of partitioning sparse matrix representations

DOI10.1007/BF01934515zbMath0528.68027OpenAlexW2065182554MaRDI QIDQ786530

J. P. Malmquist, Edward L. Robertson

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934515

zbMATH Keywords

NP-completenessdata structuresgraph partitioning24, 60-68 (1984)

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient Algorithm for the Partitioning of Trees
• Optimal Sequential Partitions of Graphs

This page was built for publication: On the complexity of partitioning sparse matrix representations