Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)
Molecular distance geometry problems
The Molecular Distance Geometry Problem (MDGP)  is the subclass of DGP instances with K=3. Since the DGP is NP-hard for each K , the MDGP is also NP-hard.
© Springer International Publishing Switzerland 2017