Under strict discretization and a generic feasible framework, the number of seed-fixed feasible CDDGP branch codes equals 2^|BF| times a binary-field rank difference of labeled partial-reflection masks and pruning-violation matrices.
A new algorithm for the K-DMDGP subclass of distance geometry problems with exact distances.Algorithmica, 83(8): 2400–2426, 2021
1 Pith paper cite this work, alongside 7 external citations. Polarity classification is still indexing.
1
Pith paper citing it
7
external citations · OpenAlex
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem
Under strict discretization and a generic feasible framework, the number of seed-fixed feasible CDDGP branch codes equals 2^|BF| times a binary-field rank difference of labeled partial-reflection masks and pruning-violation matrices.