NP-completeness for minimizing maximum edge length in grid embeddings (Q3677185)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness for minimizing maximum edge length in grid embeddings |
scientific article |
Statements
NP-completeness for minimizing maximum edge length in grid embeddings (English)
0 references
1985
0 references
combinatorial optimization
0 references
graph embeddings
0 references
two-dimensional lattice
0 references
