On the Uniqueness of Euclidean Distance Matrix Completions

The Euclidean distance completion problem (EDMCP) is the problem of determining whether or not a given partial matrix can be completed into a Euclidean distance matrix. In this paper, we present necessary and sufficient conditions for a given solution of the EDMCP to be unique.