An impossible combinatorial counting method in distance geometry

DOI10.1016/J.DAM.2024.02.018MaRDI QIDQ6558675zbMATH OpenFDO

Authors Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino

Publication date 20 June 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.02.018

zbMATH Keywords

branch-and-prune algorithmdistance geometry problemsolution symmetry

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• New methods for the distance geometry problem
• Discretization vertex orders in distance geometry
• Discretization orders for distance geometry problems
• The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry
• Optimal partial discretization orders for discretizable distance geometry

Cites work

• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
• A partial digest approach to restriction site mapping
• Algorithmic Aspects of Wireless Sensor Networks
• Angular synchronization by eigenvectors and semidefinite programming
• Approximation schemes for covering and packing problems in image processing and VLSI
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• Counting the Number of Solutions of KDMDGP Instances
• Die graphische Statik der starren Systeme.
• Discretization orders and efficient computation of Cartesian coordinates for distance geometry
• Discretization orders for distance geometry problems
• Discretization vertex orders in distance geometry
• Distance geometry and data science
• Euclidean distance geometry and applications
• Euclidean distance geometry. An introduction
• Explicit sensor network localization using semidefinite representations and facial reductions
• Fixed-Parameter Tractability and Completeness I: Basic Results
• scientific article; zbMATH DE number 3917126 (Why is no real title available?)
• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• Minimal NMR distance information for rigidity of protein graphs
• Multidimensional scaling.
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On graphs and rigidity of plane skeletal structures
• On the number of realizations of certain Henneberg graphs arising in protein conformation
• Realizing Euclidean distance matrices by sphere intersection
• 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.
• Set theory. An introduction to independence proofs
• The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry
• The discretizable distance geometry problem
• The discretizable molecular distance geometry problem
• The discretizable molecular distance geometry problem seems easier on proteins
• The Molecule Problem: Exploiting Structure in Global Optimization

Cited in

(1)

• Erratum to: ``Discretization vertex orders in distance geometry: Finding repetition orders is in \textbf{P} (even if \(K = 1\))

This page was built for publication: An impossible combinatorial counting method in distance geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558675)