The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051): Difference between revisions
From MaRDI portal
Latest revision as of 14:53, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete |
scientific article |
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