Abstract
The Euclidean distance matrix 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have