The K-discretization and K-incident graphs for discretizable Distance Geometry - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Optimization Letters Year : 2018

The K-discretization and K-incident graphs for discretizable Distance Geometry

Abstract

The Distance Geometry Problem (DGP) is the problem of determining whether a realization for a simple weighted undirected graph G=(V,E,d) in a given Euclidean space exists so that the distances between pairs of realized vertices u, v∈V correspond to the weights duv, for each {u,v}∈E. We focus on a special class of DGP instances, referred to as the Discretizable DGP (DDGP), and we introduce the K-discretization and the K-incident graphs for the DDGP class. The K-discretization graph is independent on the vertex order that can be assigned to V, and can be useful for discovering whether one of such orders actually exists so that the DDGP assumptions are satisfied. The use of a given vertex order allows the definition of another important graph, the K-incident graph, which is potentially useful for performing pre-processing analysis on the solution set of DDGP instances.
Fichier principal
Vignette du fichier
optlet18b.pdf (179.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01826217 , version 1 (29-11-2020)

Identifiers

Cite

Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino. The K-discretization and K-incident graphs for discretizable Distance Geometry. Optimization Letters, 2018, 14 (2), pp.1-14. ⟨10.1007/s11590-018-1294-2⟩. ⟨hal-01826217⟩
732 View
164 Download

Altmetric

Share

Gmail Facebook X LinkedIn More