Bandwidth and profile minimization

DOI10.1007/3-540-50728-0_57OpenAlexW1581640553MaRDI QIDQ6199476

Burkhard Monien, Manfred Wiegers

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-50728-0_57

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The NP-completeness of the bandwidth minimization problem
• The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
• Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
• On the Probable Performance of Heuristics for Bandwidth Minimization
• The bandwidth problem for graphs and matrices—a survey
• The Bandwidth of Caterpillars with Hairs of Length 1 and 2
• Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
• 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
• A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront

This page was built for publication: Bandwidth and profile minimization