Embedding Graphs as Euclidean kNN-Graphs

T. Schibler, S. Suri, J. Xue

Let G = (V, E) be a directed graph on n vertices where each vertex has out-degree k. We say that G is kNN-realizable in d-dimensional Euclidean space if there exists a point set P…