A new Algorithm to Finding Discretizable Orderings for Distance Geometry
W. Gramacho, A. Mucherino, N. Maculan

We present a new algorithm to finding suitable orderings for instances of the Distance Geometry Problem (DGP) that can allow for discretization. We present some preliminary computational results showing that the new algorithm outperforms a previously proposed one.