Manzur and Hamed (M-H) algorithm for resequencing nodes in...

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

M.Ali Ajiz, M.Mustafa Hamed
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
61
Year:
1996
Language:
english
Pages:
14
Journal:
Computers & Structures
DOI:
10.1016/0045-7949(96)00028-4
File:
PDF, 907 KB
english, 1996
Conversion to is in progress
Conversion to is failed