The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051)
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 bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete |
scientific article; zbMATH DE number 2111120
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete |
scientific article; zbMATH DE number 2111120 |
Statements
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (English)
0 references
27 October 2004
0 references
0 references
0 references
