Euclidean Distance Geometry
-15%
portes grátis
Euclidean Distance Geometry
An Introduction
Liberti, Leo; Lavor, Carlile
Springer International Publishing AG
05/2018
133
Mole
Inglês
9783319869346
15 a 20 dias
3251
Descrição não disponível.
Introduction.- 1. Motivation.- 2. The Distance Geometry Problem.- 3. Realizing Complete Graphs.- 4. Discretizability.- 5. Molecular Distance Geometry Problems.- 6.Vertex Orders.- 7. Flexibility and Rigidity.- 8. Approximate Realizations.- 9. Taking DG Further.- Appendix A. Mathematical Notions.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
convex optimization;complete graphs;discretizability;K-laterative graphs;Mathematica;vertex orders;Branch-and-Prune algorithm;weighted adjacency matrix;mathematical programming;graph visualization;clock synchronization;localization of sensor networks;unmanned underwater vehicles;Isomap;Multidimensional Scaling;Dimensionality Reduction
Introduction.- 1. Motivation.- 2. The Distance Geometry Problem.- 3. Realizing Complete Graphs.- 4. Discretizability.- 5. Molecular Distance Geometry Problems.- 6.Vertex Orders.- 7. Flexibility and Rigidity.- 8. Approximate Realizations.- 9. Taking DG Further.- Appendix A. Mathematical Notions.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
convex optimization;complete graphs;discretizability;K-laterative graphs;Mathematica;vertex orders;Branch-and-Prune algorithm;weighted adjacency matrix;mathematical programming;graph visualization;clock synchronization;localization of sensor networks;unmanned underwater vehicles;Isomap;Multidimensional Scaling;Dimensionality Reduction
