Normal view MARC view ISBD view

Euclidean Distance Geometry

516.1

Liberti, Leo. Euclidean Distance Geometry An Introduction / by Leo Liberti, Carlile Lavor. -
XIII, 133 p. 60 illus., 31 illus. in color. online resource. - (Springer Undergraduate Texts in Mathematics and Technology, ) Content notes : 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. 9783319607924 * Discrete groups. Computational complexity. Algorithms. Convex and Discrete Geometry. Discrete Optimization. Discrete Mathematics in Computer Science. Algorithms. Discrete Mathematics. * Lavor, Carlile., aut, http://id.loc.gov/vocabulary/relators/aut * Title * Series

Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com)