Nearest neighbour graph realizability is NP-hard (Q5096336)
From MaRDI portal
scientific article; zbMATH DE number 7572147
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearest neighbour graph realizability is NP-hard |
scientific article; zbMATH DE number 7572147 |
Statements
Nearest neighbour graph realizability is NP-hard (English)
0 references
16 August 2022
0 references
complexity theory
0 references
NP-hardness
0 references
proximity graphs
0 references
nearest neighbour graphs
0 references
geometric graphs
0 references
computational geometry
0 references
graph drawing
0 references
pattern recognition
0 references
