NP-completeness for minimizing maximum edge length in grid embeddings (Q3677185): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: DBLP publication ID (P1635): journals/jal/MillerO85, #quickstatements; #temporary_batch_1731505720702 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(85)90016-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117771589 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jal/MillerO85 / rank | |||
Normal rank | |||
Latest revision as of 15:25, 13 November 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
