Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev, Karamjeet Singh, Ji Zeng

Journal title: Lecture Notes in Computer Science, Algorithms and Discrete Applied Mathematics

Journal publisher: Springer Nature Switzerland

Published year: 2025

Published pages: 358-367

DOI identifier: 10.1007/978-3-031-83438-7_30