Abstract
In this chapter, we propose some methods for realizing large graphs. These methods do not explicitly rely on the adjacency structure of the graph, and are mostly based on linear algebra.
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.
Some texts define distance matrices to contain the squared distances \(\Vert x_i-x_j\Vert ^2\) —we would call this a squared distance matrix instead.
- 2.
Establishing the worst-case complexity class of EDMCP is another great open challenge in DG.
- 3.
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). Approximate realizations. In: Euclidean Distance Geometry. Springer Undergraduate Texts in Mathematics and Technology. Springer, Cham. https://doi.org/10.1007/978-3-319-60792-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-60792-4_8
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)