10 search results - page 1 / 2 » On the number of solutions of the discretizable molecular di... |
CORR
2010
Springer
12 years 10 months ago
2010
Springer
The Discretizable Molecular Distance Geometry Problem is a subset of instances of the distance geometry problem that can be solved by a combinatorial algorithm called "Branch-...
SAC
2009
ACM
13 years 11 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
JUCS
2007
13 years 4 months ago
2007
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
SMA
2009
ACM
13 years 11 months ago
2009
ACM
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...