An Optimality Criterion for Graph Embeddings of Metrics

DOI10.1137/0401023zbMath0659.05061OpenAlexW1986700065MaRDI QIDQ3808120

J. M. S. Simões-Pereira

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0401023

zbMATH Keywords

sufficient conditiondistance matrixminimum total lengthgraph realizationtree realizations

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (10)

On minimum spanning tree-like metric spaces ⋮ Reconstruction of graphs based on random walks ⋮ Underlying graph and total length of optimal realizations of variable distance matrices ⋮ An algorithm and its role in the study of optimal graph realizations of distance matrices ⋮ Distance spectra of graphs: a survey ⋮ Composed degree-distance realizations of graphs ⋮ Composed degree-distance realizations of graphs ⋮ Some personal views on the current state and the future of locational analysis ⋮ Distance realization problems with applications to internet tomography ⋮ Relaxed and approximate graph realizations

This page was built for publication: An Optimality Criterion for Graph Embeddings of Metrics