On a Relationship Between Graph Realizability and Distance Matrix Completion

DOI10.1007/978-1-4614-5134-1_3zbMath1375.05124OpenAlexW1502266461WikidataQ62562154 ScholiaQ62562154MaRDI QIDQ4596149

Leo Liberti, Carlile C. 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

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computation of protein backbones by using artificial backbones of hydrogens
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Discretization orders for distance geometry problems
• The discretizable molecular distance geometry problem
• Molecular modeling and simulation. An interdisciplinary guide
• The discretizable distance geometry problem
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Conditions for Unique Graph Realizations
• On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
• MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems