Counting The Number Of Solutions Of Kdmdgp Instances

dc.creatorLiberti L.
dc.creatorLavor C.
dc.creatorAlencar J.
dc.creatorAbud G.
dc.date2013
dc.date2015-06-25T19:16:17Z
dc.date2015-11-26T15:14:14Z
dc.date2015-06-25T19:16:17Z
dc.date2015-11-26T15:14:14Z
dc.date.accessioned2018-03-28T22:24:20Z
dc.date.available2018-03-28T22:24:20Z
dc.identifier9783642400193
dc.identifierLecture Notes In Computer Science (including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics). , v. 8085 LNCS, n. , p. 224 - 230, 2013.
dc.identifier3029743
dc.identifier10.1007/978-3-642-40020-9_23
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84884913537&partnerID=40&md5=e85189639f832b7c3ebfe23eef0712e4
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/89451
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/89451
dc.identifier2-s2.0-84884913537
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1258826
dc.descriptionWe discuss a method for finding the number of realizations in ℝK of certain simple undirected weighted graphs. © 2013 Springer-Verlag.
dc.description8085 LNCS
dc.description
dc.description224
dc.description230
dc.descriptionSociete Mathematique de France (SMF),GDR CNRS MIA,GDR CNRS Maths and Entreprises,INRIA,THALES
dc.descriptionBerger, B., Kleinberg, J., Leighton, T., Reconstructing a three-dimensional model with arbitrary errors (1999) Journal of the ACM, 46 (2), pp. 212-235
dc.descriptionCoope, 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-477
dc.descriptionDong, 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-375
dc.descriptionEren, 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-2684
dc.descriptionGraver, J., Rigidity matroids (1991) SIAM Journal on Discrete Mathematics, 4, pp. 355-368
dc.descriptionGraver, J., Servatius, B., Servatius, H., (1993) Combinatorial Rigidity, , American Mathematical Society
dc.descriptionHendrickson, B., Conditions for unique graph realizations (1992) SIAM Journal on Computing, 21 (1), pp. 65-84
dc.descriptionLavor, 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-796
dc.descriptionLavor, C., Liberti, L., Maculan, N., Mucherino, A., The discretizable molecular distance geometry problem (2012) Computational Optimization and Applications, 52, pp. 115-146
dc.descriptionLavor, 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-706
dc.descriptionLiberti, 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-17
dc.descriptionLiberti, 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 York
dc.descriptionLiberti, L., Lavor, C., Mucherino, A., Maculan, N., Molecular distance geometry methods: From continuous to discrete (2010) International Transactions in Operational Research, 18, pp. 33-51
dc.descriptionLiberti, 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
dc.descriptionMan-Cho So, A., Ye, Y., Theory of semidefinite programming for sensor network localization (2007) Mathematical Programming B, 109, pp. 367-384
dc.descriptionNie, J., Ranestad, K., Sturmfels, B., The algebraic degree of semidefinite programming (2010) Mathematical Programming A, 122 (2), pp. 379-405
dc.descriptionRanestad, 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-489
dc.descriptionSchlick, T., (2002) Molecular Modelling and Simulation: An Interdisciplinary Guide, , Springer, New York
dc.descriptionTay, T.S., Whiteley, W., Generating isostatic frameworks (1985) Structural Topology, 11, pp. 21-69
dc.languageen
dc.publisher
dc.relationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsfechado
dc.sourceScopus
dc.titleCounting The Number Of Solutions Of Kdmdgp Instances
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución