Abstract
We begin this chapter by describing an important class of the DGP in ℝ3 having a vertex order as described in Sect. 3.3, called the Discretizable DGP3 (DDGP3). Even though this definition can be extended to ℝK [65], we will consider just the case K = 3.
Cite
CITATION STYLE
APA
Lavor, C., Liberti, L., Lodwick, W. A., & Mendonça da Costa, T. (2017). The discretizable distance geometry problem (DDGP3). In SpringerBriefs in Computer Science (Vol. 0, pp. 21–29). Springer. https://doi.org/10.1007/978-3-319-57183-6_4
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