Abstract
Nearest neighbour graphs are geometric graphs defined on point sets. They express certain proximity relations. This paper gives several ways to define these graphs (weak, strong, mutual and general nearest neighbour graphs) and shows, for each definition, that the problem of determining whether a given combinatorial graph can be realized as such a nearest neighbour graph is NP-hard.
Author supplied keywords
Cite
CITATION STYLE
Eades, P., & Whitesides, S. (1995). Nearest neighbour graph realizability is NP-hard. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 911, pp. 245–256). Springer Verlag. https://doi.org/10.1007/3-540-59175-3_93
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
