The inverse Voronoi problem in graphs. I: Hardness (Q2006948): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SANET / rank | |||
Normal rank | |||
Revision as of 01:23, 1 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
