2 search results - page 1 / 1 » On a discretizable subclass of instances of the molecular di... |
SAC
2009
ACM
14 years 2 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...
CORR
2010
Springer
13 years 1 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-...