A cycle-based formulation for the distance geometry problem
type: Item
instance of: scholarly article
title: A cycle-based formulation for the distance geometry problem
zbMATH Open document ID: 1481.90305
DOI: 10.1007/978-3-030-63072-0_8
author: Leo Liberti
author: Gabriele Iommazzo
author: Carlile Lavor
author: Nelson Maculan
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7440731
zbMATH Keywords: mathematical programming
zbMATH Keywords: cycle basis
zbMATH Keywords: protein conformation
MaRDI profile type: Publication
full work available at URL: 978-3-030-63072-0 8
OpenAlex ID: W3135846615
cites work: Edge-swapping algorithms for the minimum fundamental cycle basis problem
cites work: Is the Distance Geometry Problem in NP?
cites work: Generic global rigidity
cites work: New error measures and methods for realizing protein graphs from distance data
cites work: Algorithms for Generating Fundamental Cycles in a Graph
cites work: Q3046492
cites work: A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
cites work: Cycle bases in graphs characterization, algorithms, complexity, and applications
cites work: Recent advances on the discretizable molecular distance geometry problem
cites work: A matroid view of key theorems for edge-swapping algorithms
cites work: Euclidean Distance Geometry
cites work: Open research areas in distance geometry
cites work: Counting the Number of Solutions of KDMDGP Instances
cites work: A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
cites work: Euclidean Distance Geometry and Applications
cites work: Molecular distance geometry methods: from continuous to discrete
cites work: A greedy approach to compute a minimum cycle basis of a directed graph
cites work: On minimal elementary bipartite graphs
cites work: An algorithm for finding a fundamental set of cycles of a graph
cites work: Q3285875
cites work: Angular synchronization by eigenvectors and semidefinite programming
description: scientific article; zbMATH DE number 7440731