On a relationship between graph realizability and distance matrix completion

Leo Liberti; Carlile Lavor

doi:10.1007/978-1-4614-5134-1_3

On a relationship between graph realizability and distance matrix completion

Leo Liberti
, Carlile Lavor

University of Campinas (UNICAMP)

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

We consider a certain subclass of Henneberg-type edge-weighted graphs which is related to protein structure, and discuss an algorithmic relationship between the Distance Geometry Problem and the Euclidean Distance Matrix Completion Problem.

langue originale	Anglais
titre	Optimization Theory, Decision Making, and Operations Research Applications
Sous-titre	Proceedings of the 1st International Symposium and 10th Balkan Conference on Ope
Editeur	Springer New York LLC
Pages	39-48
Nombre de pages	10
ISBN (imprimé)	9781461451334
Les DOIs	https://doi.org/10.1007/978-1-4614-5134-1_3
état	Publié - 1 janv. 2013

Série de publications

Nom	Springer Proceedings in Mathematics and Statistics
Volume	31
ISSN (imprimé)	2194-1009
ISSN (Electronique)	2194-1017

Accès au document

10.1007/978-1-4614-5134-1_3

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

Liberti, L., & Lavor, C. (2013). On a relationship between graph realizability and distance matrix completion. Dans Optimization Theory, Decision Making, and Operations Research Applications: Proceedings of the 1st International Symposium and 10th Balkan Conference on Ope (p. 39-48). (Springer Proceedings in Mathematics and Statistics; Vol 31). Springer New York LLC. https://doi.org/10.1007/978-1-4614-5134-1_3

@inproceedings{5e3936fb916847848f53d651fc2c0977,

title = "On a relationship between graph realizability and distance matrix completion",

abstract = "We consider a certain subclass of Henneberg-type edge-weighted graphs which is related to protein structure, and discuss an algorithmic relationship between the Distance Geometry Problem and the Euclidean Distance Matrix Completion Problem.",

author = "Leo Liberti and Carlile Lavor",

year = "2013",

month = jan,

day = "1",

doi = "10.1007/978-1-4614-5134-1\_3",

language = "English",

isbn = "9781461451334",

series = "Springer Proceedings in Mathematics and Statistics",

publisher = "Springer New York LLC",

pages = "39--48",

booktitle = "Optimization Theory, Decision Making, and Operations Research Applications",

}

Liberti, L & Lavor, C 2013, On a relationship between graph realizability and distance matrix completion. Dans Optimization Theory, Decision Making, and Operations Research Applications: Proceedings of the 1st International Symposium and 10th Balkan Conference on Ope. Springer Proceedings in Mathematics and Statistics, VOL. 31, Springer New York LLC, p. 39-48. https://doi.org/10.1007/978-1-4614-5134-1_3

On a relationship between graph realizability and distance matrix completion. / Liberti, Leo; Lavor, Carlile.
Optimization Theory, Decision Making, and Operations Research Applications: Proceedings of the 1st International Symposium and 10th Balkan Conference on Ope. Springer New York LLC, 2013. p. 39-48 (Springer Proceedings in Mathematics and Statistics; Vol 31).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

TY - GEN

T1 - On a relationship between graph realizability and distance matrix completion

AU - Liberti, Leo

AU - Lavor, Carlile

PY - 2013/1/1

Y1 - 2013/1/1

N2 - We consider a certain subclass of Henneberg-type edge-weighted graphs which is related to protein structure, and discuss an algorithmic relationship between the Distance Geometry Problem and the Euclidean Distance Matrix Completion Problem.

AB - We consider a certain subclass of Henneberg-type edge-weighted graphs which is related to protein structure, and discuss an algorithmic relationship between the Distance Geometry Problem and the Euclidean Distance Matrix Completion Problem.

UR - https://www.scopus.com/pages/publications/84883341082

U2 - 10.1007/978-1-4614-5134-1_3

DO - 10.1007/978-1-4614-5134-1_3

M3 - Conference contribution

AN - SCOPUS:84883341082

SN - 9781461451334

T3 - Springer Proceedings in Mathematics and Statistics

SP - 39

EP - 48

BT - Optimization Theory, Decision Making, and Operations Research Applications

PB - Springer New York LLC

ER -

Liberti L, Lavor C. On a relationship between graph realizability and distance matrix completion. Dans Optimization Theory, Decision Making, and Operations Research Applications: Proceedings of the 1st International Symposium and 10th Balkan Conference on Ope. Springer New York LLC. 2013. p. 39-48. (Springer Proceedings in Mathematics and Statistics). doi: 10.1007/978-1-4614-5134-1_3

On a relationship between graph realizability and distance matrix completion

Résumé

Série de publications

Accès au document

Autres fichiers et liens

Empreinte digitale

Contient cette citation