The Discretizable Molecular Distance Geometry Problem

Carlile Lavor, Leo Liberti, Nelson Maculan

Given a weighted undirected graph $G=(V,E,d)$, the Molecular Distance Geometry Problem (MDGP) is that of finding a function $x:G\to {\mathbb{R}}^3$, where $||x(u)-x(v)||=d(u,v)$ fo…