Skip to main content
SpringerLink
Log in

Counting the Number of Solutions of KDMDGP Instances

  • Conference paper
Geometric Science of Information (GSI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 8085))

Included in the following conference series:

Abstract

We discuss a method for finding the number of realizations in ℝK of certain simple undirected weighted graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berger, B., Kleinberg, J., Leighton, T.: Reconstructing a three-dimensional model with arbitrary errors. Journal of the ACM 46(2), 212–235 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Coope, I.: Reliable computation of the points of intersection of n spheres in ℝn. Australian and New Zealand Industrial and Applied Mathematics Journal 42, 461–477 (2000)

    MathSciNet  Google Scholar 

  3. Dong, Q., Wu, Z.: A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances. Journal of Global Optimization 22, 365–375 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Eren, T., Goldenberg, D., Whiteley, W., Yang, Y., Morse, A., Anderson, B., Belhumeur, P.: Rigidity, computation, and randomization in network localization. In: IEEE Infocom Proceedings, pp. 2673–2684 (2004)

    Google Scholar 

  5. Graver, J.: Rigidity matroids. SIAM Journal on Discrete Mathematics 4, 355–368 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity. American Mathematical Society (1993)

    Google Scholar 

  7. Hendrickson, B.: Conditions for unique graph realizations. SIAM Journal on Computing 21(1), 65–84 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lavor, C., Lee, J., John, A.L.S., Liberti, L., Mucherino, A., Sviridenko, M.: Discretization orders for distance geometry problems. Optimization Letters 6, 783–796 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: The discretizable molecular distance geometry problem. Computational Optimization and Applications 52, 115–146 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: Recent advances on the discretizable molecular distance geometry problem. European Journal of Operational Research 219, 698–706 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Liberti, L., Lavor, C., Maculan, N.: A branch-and-prune algorithm for the molecular distance geometry problem. International Transactions in Operational Research 15, 1–17 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Liberti, L., Lavor, C., Mucherino, A.: The discretizable molecular distance geometry problem is easier on proteins. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods, and Applications. Springer, New York (2013)

    Google Scholar 

  13. Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular distance geometry methods: from continuous to discrete. International Transactions in Operational Research 18, 33–51 (2010)

    Article  MathSciNet  Google Scholar 

  14. Liberti, 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 (accepted)

    Google Scholar 

  15. Man-Cho So, A., Ye, Y.: Theory of semidefinite programming for sensor network localization. Mathematical Programming B 109, 367–384 (2007)

    Article  MATH  Google Scholar 

  16. Nie, J., Ranestad, K., Sturmfels, B.: The algebraic degree of semidefinite programming. Mathematical Programming A 122(2), 379–405 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ranestad, K., Sturmfels, B.: Personal Communication (2013)

    Google Scholar 

  18. Saxe, J.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications, Control and Computing, pp. 480–489 (1979)

    Google Scholar 

  19. Schlick, T.: Molecular modelling and simulation: an interdisciplinary guide. Springer, New York (2002)

    Book  Google Scholar 

  20. Tay, T.S., Whiteley, W.: Generating isostatic frameworks. Structural Topology 11, 21–69 (1985)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM “T.J. Watson” Research Center, Yorktown Heights, 10598, NY, USA

    Leo Liberti

  2. LIX, Ecole Polytechnique, 91128, Palaiseau, France

    Leo Liberti

  3. Dept. of Applied Math. (IMECC-UNICAMP), University of Campinas, 13081-970, Campinas, SP, Brazil

    Carlile Lavor, Jorge Alencar & Germano Abud

Authors
  1. Leo Liberti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlile Lavor
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jorge Alencar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Germano Abud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sony Computer Science Laboratories Inc, Tokyo, Japan

    Frank Nielsen

  2. Thales Land Air Systems, 91470, Limours, France

    Frédéric Barbaresco

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liberti, L., Lavor, C., Alencar, J., Abud, G. (2013). Counting the Number of Solutions of KDMDGP Instances. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2013. Lecture Notes in Computer Science, vol 8085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40020-9_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40020-9_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40019-3

  • Online ISBN: 978-3-642-40020-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation