A new Algorithm to Finding Discretizable Orderings for Distance Geometry - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A new Algorithm to Finding Discretizable Orderings for Distance Geometry

(1) , (2) , (2) , (3)
1
2
3

Antonio Mucherino  : Connect in order to contact the contributor

https://hal.inria.fr/hal-00912706

Submitted on : Monday, December 2, 2013-3:20:31 PM

Last modification on : Tuesday, February 7, 2023-2:44:50 PM

Not file

Dates and versions

hal-00912706 , version 1 (02-12-2013)

Identifiers

  • HAL Id : hal-00912706 , version 1

Cite

Warley Gramacho, Douglas Gonçalves, Antonio Mucherino, Nelson Maculan. A new Algorithm to Finding Discretizable Orderings for Distance Geometry. Distance Geometry and Applications (DGA13), Jun 2013, Manaus, Amazonas, Brazil. pp.149-152. ⟨hal-00912706⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

INSTITUT-TELECOM EC-PARIS UNIV-RENNES1 CNRS INRIA INSA-RENNES IRISA IRISA-D7 INRIA2 UR1-MATH-STIC UR1-UFR-ISTIC UNIV-RENNES UR1-MATH-NUM
256 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More