A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 798643 (Why is no real title available?)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
- A spectral algorithm for envelope reduction of sparse matrices
- Algorithms for reducing the bandwidth and profile of a sparse matrix
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- GRASP and path relinking for the matrix bandwidth minimization.
- Nodal ordering for bandwidth reduction using ant system algorithm
Cited in
(6)- A new node renumbering algorithm for bandwidth reduction
- A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
- scientific article; zbMATH DE number 3866470 (Why is no real title available?)
- scientific article; zbMATH DE number 4134066 (Why is no real title available?)
- scientific article; zbMATH DE number 798643 (Why is no real title available?)
- A constructive bandwidth reduction algorithm
This page was built for publication: A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504151)