{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:18:00Z","timestamp":1762175880111},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1007\/bf02187901","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T08:11:50Z","timestamp":1130573510000},"page":"103-122","source":"Crossref","is-referenced-by-count":30,"title":["On optimal realizations of finite metric spaces by graphs"],"prefix":"10.1007","volume":"3","author":[{"given":"Ingo","family":"Alth\u00f6fer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1988,6,1]]},"reference":[{"key":"BF02187901_CR1","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1090\/qam\/265210","volume":"26","author":"F. T. Boesch","year":"1968","unstructured":"F. T. Boesch, Properties of the distance matrix of a tree,Quart. Appl. Math. 26 (1968), 607\u2013609.","journal-title":"Quart. Appl. Math."},{"key":"BF02187901_CR2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0095-8956(74)90047-1","volume":"17","author":"P. Buneman","year":"1974","unstructured":"P. Buneman, A note on the metric properties of trees,J. Combin. Theory Ser. B 17 (1974), 48\u201350.","journal-title":"J. Combin. Theory Ser. B"},{"key":"BF02187901_CR3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1137\/0604006","volume":"4","author":"S. Chaiken","year":"1983","unstructured":"S. Chaiken, A. K. Dewdney, and P. S. Slater, An optmal diagonal tree code,SIAM J. Algebraic Discrete Methods 4 (1983), 42\u201349.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF02187901_CR4","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/S0019-9958(79)90410-8","volume":"40","author":"A.K. Dewdney","year":"1979","unstructured":"A.K. Dewdney, Diagonal tree codes,Inform. and Control 40 (1979), 234\u2013239.","journal-title":"Inform. and Control"},{"key":"BF02187901_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0001-8708(84)90029-X","volume":"53","author":"A. W. M. Dress","year":"1984","unstructured":"A. W. M. Dress, Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: a note on combinatorial properties of metric spaces.Adv. in Math. 53 (1984), 321\u2013402","journal-title":"Adv. in Math."},{"key":"BF02187901_CR6","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1038\/scientificamerican0481-88","volume":"244","author":"M. Eigen","year":"1981","unstructured":"M. Eigen, W. Gardiner, P. Shuster and R. Winkler-Oswatitsch, The origin of genetic information,Sci. Amer. 244 (1981), 78\u201394.","journal-title":"Sci. Amer."},{"key":"BF02187901_CR7","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability, a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"BF02187901_CR8","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S. L. Hakimi","year":"1964","unstructured":"S. L. Hakimi, Optimum locations of switching centers and medians of a graph,Oper. Res. 12 (1964), 450\u2013459.","journal-title":"Oper. Res."},{"key":"BF02187901_CR9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1090\/qam\/184873","volume":"22","author":"S. L. Hakimi","year":"1964","unstructured":"S. L. Hakimi and S. S. Yau, Distance matrix of a graph and its realizability,Quart. Appl. Math. 22 (1964), 305\u2013317.","journal-title":"Quart. Appl. Math."},{"key":"BF02187901_CR10","first-page":"19","volume":"178","author":"W. Imrich","year":"1969","unstructured":"W. Imrich, Realisierung von Metriken in Graphen,\u00d6sterreich. Akad. Wiss. Math.-Natur. Kl. Sitzunsber. II 178 (1969), 19\u201324.","journal-title":"\u00d6sterreich. Akad. Wiss. Math.-Natur. Kl. Sitzunsber. II"},{"key":"BF02187901_CR11","first-page":"129","volume-title":"Contributions to Graph Theory and Its Applications","author":"W. Imrich","year":"1977","unstructured":"W. Imrich, On metric properties of tree like spaces, inContributions to Graph Theory and Its Applications (Intern. Colloq. Oberhof 1977) 129\u2013156, Technische Hochschule Ilmenau, Ilmenau, 1977."},{"key":"BF02187901_CR12","first-page":"347","volume":"17","author":"W. Imrich","year":"1983","unstructured":"W. Imrich and G. Schwarz, Trees and length functions in groups,Ann. Discrete Math. 17 (1983), 347\u2013359.","journal-title":"Ann. Discrete Math."},{"key":"BF02187901_CR13","first-page":"558","volume":"13","author":"W. Imrich","year":"1972","unstructured":"W. Imrich and E. Stockii, On optimal embeddings of metrics in graphs,Sibirsk. Mat. Z. 13 (1972), 558\u2013565.","journal-title":"Sibirsk. Mat. Z."},{"key":"BF02187901_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(84)90009-1","volume":"36","author":"W. Imrich","year":"1984","unstructured":"W. Imrich, J. M. S. Sim\u00f5es-Pereira, and C. M. Zamfirescu, On optimal embeddings of metrics in graphs,J. Combin. Theory Ser. B 36 (1984), 1\u201315.","journal-title":"J. Combin. Theory Ser. B"},{"key":"BF02187901_CR15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/qam\/414405","volume":"30","author":"A. N. Patrinos","year":"1972","unstructured":"A. N. Patrinos and S. L. Hakimi, The distance matrix of a graph and its tree realization,Quart. Appl. Math. 30 (1972) 255\u2013269.","journal-title":"Quart. Appl. Math."},{"key":"BF02187901_CR16","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"I","author":"P. H. Sellers","year":"1980","unstructured":"P. H. Sellers, The theory and computation of evolutionary distances: pattern recognition,J. Algorithms I (1980), 359\u2013373.","journal-title":"J. Algorithms"},{"key":"BF02187901_CR17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0021-9800(69)80092-X","volume":"6","author":"J. M. Sim\u00f5es-Pereira","year":"1969","unstructured":"J. M. Sim\u00f5es-Pereira, A note on the tree realizability of a distance matrix,J. Combin. Theory 6 (1969), 303\u2013310.","journal-title":"J. Combin. Theory"},{"key":"BF02187901_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0605014","volume":"5","author":"J. M. S. Sim\u00f5es-Pereira","year":"1984","unstructured":"J. M. S. Sim\u00f5es-Pereira, A note on optimal and suboptimal digraph realizations of quasidistance matrices,SIAM J. Algebraic Discrete Methods 5 (1984), 117\u2013132.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF02187901_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(82)90001-5","volume":"44","author":"J. M. S. Sim\u00f5es-Pereira","year":"1982","unstructured":"J. M. S. Sim\u00f5es-Pereira and C. M. Zamfirescu, Submatrices of non-tree-realizable distance matrices,Linear Algebra Appl. 44 (1982), 1\u201317.","journal-title":"Linear Algebra Appl."},{"key":"BF02187901_CR20","first-page":"371","volume":"2","author":"E. A. Smolenskii","year":"1962","unstructured":"E. A. Smolenskii, A method for the linear recording of graphs,Zh. Vychisl. Mat. i Mat. Fiz. 2 (1962), 371\u2013372 (in Russian).","journal-title":"Zh. Vychisl. Mat. i Mat. Fiz."},{"key":"BF02187901_CR21","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1287\/opre.30.4.725","volume":"30","author":"B. C. Tansel","year":"1982","unstructured":"B. C. Tansel, R. L. Francis, T. J. Lowe, and M. L. Chen, Duality and distance constraints for the non-linearp-center problem and covering problem on a tree network,Oper. Res. 30 (1982), 725\u2013744.","journal-title":"Oper. Res."},{"key":"BF02187901_CR22","first-page":"90","volume":"20","author":"K. A. Zareckii","year":"1965","unstructured":"K. A. Zareckii, Constructing a tree on the basis of a set of distances between the hanging vertices,Uspekhi Mat. Nauk 20 (1965), 90\u201392 (in Russian).","journal-title":"Uspekhi Mat. Nauk"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187901.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187901\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T17:22:36Z","timestamp":1557854556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["BF02187901"],"URL":"https:\/\/doi.org\/10.1007\/bf02187901","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}