On the complexity of partitioning sparse matrix representations

DOI10.1007/BF01934515MaRDI QIDQ786530zbMATH OpenOpenAlexFDO

Authors 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

data structuresgraph partitioningNP-completeness24, 60-68 (1984)

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3635458 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786530)