Abstract
We remarked in Sect. 2.5.1 that direct methods, which search for solutions in the continuous space \(\mathbbm {R}^{Kn}\) of all realizations, do not always work all that well. In Chap. 3, we discussed a discrete method for realizing complete graphs in polytime. In this chapter, we look at larger classes of graphs for which the search space can be shown to be discrete.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In fact, of a measurable set.
- 2.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Liberti, L., Lavor, C. (2017). Discretizability. In: Euclidean Distance Geometry. Springer Undergraduate Texts in Mathematics and Technology. Springer, Cham. https://doi.org/10.1007/978-3-319-60792-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-60792-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60791-7
Online ISBN: 978-3-319-60792-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)