On a relationship between graph realizability and distance matrix completion

DOI10.1007/978-1-4614-5134-1_3MaRDI QIDQ4596149zbMATH OpenOpenAlexWikidataFDO

Authors Leo Liberti, Carlile Lavor

Publication date 30 November 2017

Published in Optimization Theory, Decision Making, and Operations Research Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-5134-1_3

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Applications of graph theory (05C90)

Recommendations

• The Euclidian Distance Matrix Completion Problem
• The Euclidean distance completion problem: cycle completability
• On the number of realizations of certain Henneberg graphs arising in protein conformation
• Distance geometry problem and algorithm based on barycentric coordinates
• An algorithm and its role in the study of optimal graph realizations of distance matrices

Cites work

• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Conditions for Unique Graph Realizations
• Discretization orders for distance geometry problems
• scientific article; zbMATH DE number 3917126 (Why is no real title available?)
• scientific article; zbMATH DE number 3080144 (Why is no real title available?)
• MD-jeep: an implementation of a branch and prune algorithm for distance geometry problems
• Molecular modeling and simulation. An interdisciplinary guide
• On the computation of protein backbones by using artificial backbones of hydrogens
• On the definition of artificial backbones for the discretizable molecular distance geometry problem
• On the number of solutions of the discretizable molecular distance geometry problem
• The discretizable distance geometry problem
• The discretizable molecular distance geometry problem
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances

Cited in

(3)

• On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
• A note on the Cayley-Menger determinant and the molecular distance geometry problem
• Distance geometry and data science

This page was built for publication: On a relationship between graph realizability and distance matrix completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596149)