Minimizing the bandwidth of sparse symmetric matrices
From MaRDI portal
Publication:2561468
DOI10.1007/BF02252900zbMath0263.65049MaRDI QIDQ2561468
Publication date: 1973
Published in: Computing (Search for Journal in Brave)
Related Items (11)
Bandwidth Minimization: An approximation algorithm for caterpillars ⋮ Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction ⋮ Graph layout problems ⋮ Computational methods of linear algebra ⋮ Approximation algorithms for the bandwidth minimization problem for a large class of trees ⋮ A survey of direct methods for sparse linear systems ⋮ Processor-efficient sparse matrix-vector multiplication ⋮ The NP-completeness of the bandwidth minimization problem ⋮ Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions ⋮ Note on minimizing the bandwidth of sparse, symmetric matrices ⋮ Bandwidth constraints on problems complete for polynomial time
Cites Work
This page was built for publication: Minimizing the bandwidth of sparse symmetric matrices
