Abstract
We know that to ensure the finiteness of the solution set of the DGP, we can impose an order on the vertices of the associated graph. If such an order exists, it is not hard to find it in the DGP graph.
Cite
CITATION STYLE
APA
Lavor, C., Liberti, L., Lodwick, W. A., & Mendonça da Costa, T. (2017). The discretizable molecular distance geometry problem (DMDGP). In SpringerBriefs in Computer Science (Vol. 0, pp. 31–39). Springer. https://doi.org/10.1007/978-3-319-57183-6_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free