A cycle-based formulation for the distance geometry problem
From MaRDI portal
Publication:2056892
DOI10.1007/978-3-030-63072-0_8zbMath1481.90305OpenAlexW3135846615MaRDI QIDQ2056892
Leo Liberti, Gabriele Iommazzo, Nelson F. Maculan, Carlile C. Lavor
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-63072-0_8
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- New error measures and methods for realizing protein graphs from distance data
- Angular synchronization by eigenvectors and semidefinite programming
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- A greedy approach to compute a minimum cycle basis of a directed graph
- On minimal elementary bipartite graphs
- Recent advances on the discretizable molecular distance geometry problem
- A matroid view of key theorems for edge-swapping algorithms
- Open research areas in distance geometry
- Generic global rigidity
- Is the Distance Geometry Problem in NP?
- Molecular distance geometry methods: from continuous to discrete
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Algorithms for Generating Fundamental Cycles in a Graph
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Euclidean Distance Geometry
- Euclidean Distance Geometry and Applications
- Counting the Number of Solutions of KDMDGP Instances
- An algorithm for finding a fundamental set of cycles of a graph
