In this paper, we study the complexity of the selection of a graph discretization order with a stepwise linear cost function.Finding such vertex ordering has been proved to be an essential step to solve discretizable distance geometry problems (DDGPs). DDGPs constitute a class of graph realization problems where the vertices can be ordered in such a way that the search space of possible positions becomes discrete, usually represented by a binary tree. In particular, it is useful to find discretization orders that minimize an indicator of the size of the search tree. Our stepwise linear cost function generalizes this situation and allows to discriminate the vertices into three categories depending on the number of adjacent predecessors of each vertex in the order and on two parameters $K$ and $U$. We provide a complete study of NP-completeness for fixed values of $K$ and $U$. Our main result is that the problem is NP-complete in general for all values of $K$ and $U$ such that $U\geq K+1$ and $U\geq 2$. A consequence of this result is that the minimization of vertices with exactly $K$ adjacent predecessors in a discretization order is also NP-complete.

## Citation

Unpublished, stored on institutional HAL website with manuscript number hal-02025298, version 1, 2019.

## Article

View Vertex ordering with optimal number of adjacent predecessors