NP-completeness for minimizing maximum edge length in grid embeddings (Q3677185): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59592734, #quickstatements; #temporary_batch_1706298923732 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:35, 5 February 2024
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
