The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete (Q3026359)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete |
scientific article |
Statements
The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete (English)
0 references
1986
0 references
NP completeness
0 references
bandwidth minimization
0 references
caterpillars with hairs of length at most three
0 references
trees
0 references
0 references
0 references
