The NP-Completeness of the bandwidth minimization problem

1976/09/01 by Ch. H. Papadimitriou · 4 citations
Computer Science · Engineering · #Digital Image Processing Techniques #Matrix Theory and Algorithms #graph theory and CDMA systems

paper · doi:10.1007/bf02280884

crossref issued 1976/09/01 · crossref published 1976/09/01 · crossref published-print 1976/09/01 · openalex publication_date 1976/09/01 · crossref created 2006/01/25 · crossref deposited 2019/05/16 · openalex created_date 2025/10/10 · crossref indexed 2026/08/03 · openalex updated_date 2026/08/04

Cited by

• Dyadic Factorization and Efficient Inversion of Sparse Positive Definite Matrices
• Coping with the NP-Hardness of the Graph Bandwidth Problem
• Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
• Bandwidth Parameterized by Cluster Vertex Deletion Number