We discuss a method for finding the number of realizations in ℝK of certain simple undirected weighted graphs. © 2013 Springer-Verlag.8085 LNCS 224230Societe Mathematique de France (SMF),GDR CNRS MIA,GDR CNRS Maths and Entreprises,INRIA,THALESBerger, B., Kleinberg, J., Leighton, T., Reconstructing a three-dimensional model with arbitrary errors (1999) Journal of the ACM, 46 (2), pp. 212-235Coope, I., Reliable computation of the points of intersection of n spheres in R n (2000) Australian and New Zealand Industrial and Applied Mathematics Journal, 42, pp. 461-477Dong, Q., Wu, Z., A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances (2002) Journal of Global Optimization, 22, pp. 365-375Eren, T., Goldenberg, D., Whiteley, W., Yang, Y., Morse, A., Anderson, B., Belhumeur, P., Rigidity, computation, and randomization in network localization (2004) IEEE Infocom Proceedings, pp. 2673-2684Graver, J., Rigidity matroids (1991) SIAM Journal on Discrete Mathematics, 4, pp. 355-368Graver, J., Servatius, B., Servatius, H., (1993) Combinatorial Rigidity, , American Mathematical SocietyHendrickson, B., Conditions for unique graph realizations (1992) SIAM Journal on Computing, 21 (1), pp. 65-84Lavor, C., Lee, J., John, A.L.S., Liberti, L., Mucherino, A., Sviridenko, M., Discretization orders for distance geometry problems (2012) Optimization Letters, 6, pp. 783-796Lavor, C., Liberti, L., Maculan, N., Mucherino, A., The discretizable molecular distance geometry problem (2012) Computational Optimization and Applications, 52, pp. 115-146Lavor, C., Liberti, L., Maculan, N., Mucherino, A., Recent advances on the discretizable molecular distance geometry problem (2012) European Journal of Operational Research, 219, pp. 698-706Liberti, L., Lavor, C., Maculan, N., A branch-and-prune algorithm for the molecular distance geometry problem (2008) International Transactions in Operational Research, 15, pp. 1-17Liberti, L., Lavor, C., Mucherino, A., The discretizable molecular distance geometry problem is easier on proteins (2013) Distance Geometry: Theory, Methods, and Applications, , Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Springer, New YorkLiberti, L., Lavor, C., Mucherino, A., Maculan, N., Molecular distance geometry methods: From continuous to discrete (2010) International Transactions in Operational Research, 18, pp. 33-51Liberti, L., Masson, B., Lavor, C., Lee, J., Mucherino, A., On the number of realizations of certain Henneberg graphs arising in protein conformation Discrete Applied Mathematics, , acceptedMan-Cho So, A., Ye, Y., Theory of semidefinite programming for sensor network localization (2007) Mathematical Programming B, 109, pp. 367-384Nie, J., Ranestad, K., Sturmfels, B., The algebraic degree of semidefinite programming (2010) Mathematical Programming A, 122 (2), pp. 379-405Ranestad, K., Sturmfels, B., (2013), Personal CommunicationSaxe, J., Embeddability of weighted graphs in k-space is strongly NP-hard (1979) Proceedings of 17th Allerton Conference in Communications, Control and Computing, pp. 480-489Schlick, T., (2002) Molecular Modelling and Simulation: An Interdisciplinary Guide, , Springer, New YorkTay, T.S., Whiteley, W., Generating isostatic frameworks (1985) Structural Topology, 11, pp. 21-69