The NP-completeness of the bandwidth minimization problem (Q1223124)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The NP-completeness of the bandwidth minimization problem |
scientific article; zbMATH DE number 3502700
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-completeness of the bandwidth minimization problem |
scientific article; zbMATH DE number 3502700 |
Statements
The NP-completeness of the bandwidth minimization problem (English)
0 references
1976
0 references
