An impossible combinatorial counting method in distance geometry

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

Cites Work

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

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