On a relationship between graph realizability and distance matrix completion

DOI10.1007/978-1-4614-5134-1_3zbMATH Open1375.05124OpenAlexW1502266461WikidataQ62562154 ScholiaQ62562154MaRDI QIDQ4596149FDOQ4596149

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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)