Note on minimizing the bandwidth of sparse, symmetric matrices
From MaRDI portal
Publication:2559235
DOI10.1007/BF02239468zbMath0257.65041OpenAlexW64367907MaRDI QIDQ2559235
Publication date: 1973
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02239468
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph ⋮ A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs ⋮ Computational methods of linear algebra ⋮ Finite element nodal ordering algorithms ⋮ Nodal ordering for bandwidth reduction using ant system algorithm ⋮ A general strategy on the bandwidth minimization (BM) problem ⋮ A survey of direct methods for sparse linear systems ⋮ The NP-completeness of the bandwidth minimization problem ⋮ Bandwidth and pebbling
Cites Work
This page was built for publication: Note on minimizing the bandwidth of sparse, symmetric matrices
