1976•ComputingRequires access
The NP-Completeness of the bandwidth minimization problem
Ch. H. Papadimitriou
Open publisher page 413 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Ch. H. Papadimitriou
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 413 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Completeness (order theory), Row, NP-complete, Bandwidth (computing), Minimisation (clinical trials), Mathematics, Minification, Row and column spaces