Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs

Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev +2

For an ordered point set in a Euclidean space or, more generally, in an abstract metric space, the ordered Nearest Neighbor Graph is obtained by connecting each of the points to it…