The inverse Voronoi problem in graphs. I: Hardness (Q2006948): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-020-00716-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-020-00716-4 / rank | |||
Normal rank | |||
Latest revision as of 18:15, 16 December 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
0 references
0 references
