Leo Liberti : December 9, 2010
Discrete methods for distance geometry
Leo Liberti, LIX, Ecole Polytechnique, Palaiseau, France
Thursday, December 9, 10:00 a.m. in the CERFACS conference room
Abstract:Distance geometry problems aim to find embeddings of graphs in Euclidean spaces of various dimensions. Although in general this involves a search in continuous space, with appropriate vertex orders the search space becomes discrete. We discuss theory, methods and applications.
The presentation is available.