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 (EDM). In this paper, we investigate the necessary and sufficient conditions for the uniqueness of a given EDM completion in the case where this EDM completion is generated by points in general position. We also show that the problem of checking the validity of these conditions can be formulated as a semidefinite programming problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
