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)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Optimization Theory, Decision Making, and Operations Research Applications
Subtitle of host publication	Proceedings of the 1st International Symposium and 10th Balkan Conference on Ope
Publisher	Springer New York LLC
Pages	39-48
Number of pages	10
ISBN (Print)	9781461451334
DOIs	https://doi.org/10.1007/978-1-4614-5134-1_3
Publication status	Published - 1 Jan 2013

Publication series

Name	Springer Proceedings in Mathematics and Statistics
Volume	31
ISSN (Print)	2194-1009
ISSN (Electronic)	2194-1017

Access to Document

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

Cite this

Liberti, L., & Lavor, C. (2013). On a relationship between graph realizability and distance matrix completion. In Optimization Theory, Decision Making, and Operations Research Applications: Proceedings of the 1st International Symposium and 10th Balkan Conference on Ope (pp. 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. in 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, pp. 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).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

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. In 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

Abstract

Publication series

Access to Document

Fingerprint

Cite this