An impossible combinatorial counting method in distance geometry
type: Item
instance of: scholarly article
title: An impossible combinatorial counting method in distance geometry
zbMATH Open document ID: 1541.05126
author: Germano Abud
author: Jorge Alencar
author: Carlile Lavor
author: Leo Liberti
author: Antonio Mucherino
published in: Discrete Applied Mathematics
publication date: 2024-06-20T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C22
zbMATH DE Number: 7868439
zbMATH Keywords: distance geometry problem
zbMATH Keywords: branch-and-prune algorithm
zbMATH Keywords: solution symmetry
MaRDI profile type: MaRDI publication profile
cites work: The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry
cites work: Realizing Euclidean distance matrices by sphere intersection
cites work: Algorithmic Aspects of Wireless Sensor Networks
cites work: Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Discretization vertex orders in distance geometry
cites work: Multidimensional scaling.
cites work: A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Discretization orders and efficient computation of Cartesian coordinates for distance geometry
cites work: Q4279195
cites work: The Molecule Problem: Exploiting Structure in Global Optimization
cites work: Die graphische Statik der starren Systeme.
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
cites work: Set theory. An introduction to independence proofs
cites work: On graphs and rigidity of plane skeletal structures
cites work: Discretization orders for distance geometry problems
cites work: Minimal NMR distance information for rigidity of protein graphs
cites work: The discretizable molecular distance geometry problem
cites work: Distance geometry and data science
cites work: Euclidean 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: The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
cites work: On the number of realizations of certain Henneberg graphs arising in protein conformation
cites work: The discretizable distance geometry problem
cites work: Remarks to Maurice Fréchet's article ``Sur la définition axiomatique d'une classe d'espaces vectoriels distanciés applicables vectoriellement sur l'espace de Hilbert.
cites work: Angular synchronization by eigenvectors and semidefinite programming
cites work: A partial digest approach to restriction site mapping
cites work: Q3694165
DOI: 10.1016/J.DAM.2024.02.018
description: scientific article; zbMATH DE number 7868439