1 problem

Let $\mathcal{V}$ be the vertex set of a discretizable distance geometry problem, let $rank$ assign vertices to ranks, and let $nodes(rank(v))$ denote the number of nodes at the ra…