Manzur and Hamed (M-H) algorithm for resequencing nodes in the undirected graphs to minimize the storage by reducing the bandwidth of sparse symmetric matrices

DOI10.1016/0045-7949(96)00028-4zbMATH Open0900.65126OpenAlexW1996808956MaRDI QIDQ4387481FDOQ4387481

Authors: Manzur Ali Ajiz, Mohd Mustafa Hamed 

Publication date: 1 November 1998

Published in: Computers & Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7949(96)00028-4

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational methods for sparse matrices (65F50)

This page was built for publication: Manzur and Hamed (M-H) algorithm for resequencing nodes in the undirected graphs to minimize the storage by reducing the bandwidth of sparse symmetric matrices

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