A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem

Michael Souza, Wagner da Rocha, Carlile Lavor

The Distance Geometry Problem (DGP) asks for a geometric realization of a weighted graph with \(n\) vertices in \(\mathbb{R}^K\) such that Euclidean distances between vertices matc…