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 (Q4387481)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 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 |
scientific article; zbMATH DE number 1151440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 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 |
scientific article; zbMATH DE number 1151440 |
Statements
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 (English)
0 references
1 November 1998
0 references
