Discrete Mathematics & Theoretical Computer Science |

- 1 Institut de Recherche Mathématique de Rennes
- 2 Department of Mathematics and Statistics [Guelph]

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 ≥ K + 1 and U ≥ 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.

Source: HAL:hal-02025298v3

Volume: vol. 22 no. 1

Section: Discrete Algorithms

Published on: January 9, 2020

Accepted on: December 2, 2019

Submitted on: February 25, 2019

Keywords: vertex ordering,distance geometry problem,discretization order,complexity analysis,[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC],[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO],[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Funding:

- Source : HAL
*Centre de Mathématiques Henri Lebesgue : fondements, interactions, applications et Formation*; Funder: French National Research Agency (ANR); Code: ANR-11-LABX-0020

This page has been seen 1525 times.

This article's PDF has been downloaded 336 times.