For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
2
views
0
references
 Top references
cited by
0
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      1,040
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Article: not found

      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

      Author(s): ,
      Publication date Created:
      Publication date (Print):
      Journal: Computers & Structures
      Publisher: Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Author and article information

          Journal
          Title: Computers & Structures
          Abbreviated Title: Computers & Structures
          Publisher: Elsevier BV
          ISSN (Print): 00457949
          Publication date Created: October 1996
          Publication date (Print): October 1996
          Volume: 61
          Issue: 2
          Pages: 361-374
          Article
          DOI: 10.1016/0045-7949(96)00028-4
          SO-VID: 44e97a06-d30e-41db-84bb-7f8c827f1546
          Copyright © © 1996
          License:

          https://www.elsevier.com/tdm/userlicense/1.0/

          History

          Data availability:

          Comments

          Comment on this article