A New Node Centroid Algorithm for Bandwidth Minimization
We propose a Node Centroid method with Hill-Climbing to solve the well-known matrix band-width minimization problem, which is to permute rows and columns of the matrix to minimize its bandwidth. Many heuristics have been developed for this NP-complete problem including the Cuthill-McKee (CM) and the...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2003
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2066 https://ink.library.smu.edu.sg/context/lkcsb_research/article/3065/viewcontent/Rodrigues2003NewNode269.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
Be the first to leave a comment!