The inverse Voronoi problem in graphs. I: Hardness (Q2006948): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-020-00716-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3027090837 / rank | |||
Normal rank | |||
Revision as of 02:26, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The inverse Voronoi problem in graphs. I: Hardness |
scientific article |
Statements
The inverse Voronoi problem in graphs. I: Hardness (English)
0 references
12 October 2020
0 references
distances in graphs
0 references
Voronoi diagram
0 references
inverse Voronoi problem
0 references
NP-completeness
0 references
parameterized complexity
0 references
