k-Level Crossing Minimization Is NP-Hard for Trees (Q3078383)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-Level Crossing Minimization Is NP-Hard for Trees |
scientific article |
Statements
k-Level Crossing Minimization Is NP-Hard for Trees (English)
0 references
20 February 2011
0 references
