Bandwidth and profile minimization
From MaRDI portal
Recommendations
Cites work
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 3963887 (Why is no real title available?)
- scientific article; zbMATH DE number 3974992 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- On the Probable Performance of Heuristics for Bandwidth Minimization
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2
- The bandwidth problem for graphs and matrices—a survey
- The NP-completeness of the bandwidth minimization problem
This page was built for publication: Bandwidth and profile minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199476)