Computing Geometric Minimum-Dilation Graphs Is NP-Hard (Q3595495)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Geometric Minimum-Dilation Graphs Is NP-Hard |
scientific article |
Statements
Computing Geometric Minimum-Dilation Graphs Is NP-Hard (English)
0 references
28 August 2007
0 references
dilation
0 references
geometric network
0 references
plane graph
0 references
spanning ratio
0 references
stretch factor
0 references
NP-hardness
0 references
