Computing Geometric Minimum-Dilation Graphs Is NP-Hard (Q3595495): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1838657 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Martin Kuetz / rank | |||
Normal rank | |||
| 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.1007/978-3-540-70904-6_20 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1744317798 / rank | |||
Normal rank | |||
Latest revision as of 20:16, 19 March 2024
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
