Titlebook: Euclidean Distance Geometry; An Introduction Leo Liberti,Carlile Lavor Textbook 2017 Springer International Publishing Switzerland 2017 con

本義

書目名稱Euclidean Distance Geometry影響因子(影響力)




書目名稱Euclidean Distance Geometry影響因子(影響力)學(xué)科排名




書目名稱Euclidean Distance Geometry網(wǎng)絡(luò)公開度




書目名稱Euclidean Distance Geometry網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Euclidean Distance Geometry被引頻次




書目名稱Euclidean Distance Geometry被引頻次學(xué)科排名




書目名稱Euclidean Distance Geometry年度引用




書目名稱Euclidean Distance Geometry年度引用學(xué)科排名




書目名稱Euclidean Distance Geometry讀者反饋




書目名稱Euclidean Distance Geometry讀者反饋學(xué)科排名

chandel

indignant

https://doi.org/10.1007/978-3-658-08135-5This book is a basic introduction to Distance Geometry (DG):it gives an overview of the mathematical theory of DG. Our point of view derives from our motivation to apply DG methods to the problem of finding the structure of proteins given some of the interatomic distances.

conduct

Pulmonary-Veins

Felix Wolter,Peter Preisend?rferIn this chapter, we consider the DGP on a very specific class of graphs: the (. + 1)-cliques, i.e.,?complete graphs on . + 1 vertices, where . is the dimension of the embedding space ..

侵略

侵略

A. Boscolo,E. Menosso,B. Piuzzi,M. ToppanoThe . (MDGP) [86] is the subclass of DGP instances with .=3. Since the DGP is .-hard for each . [107], the MDGP is also .-hard.

Lineage

hauteur

https://doi.org/10.1007/978-1-4419-1040-0In 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.

不吉祥的女人