The additivity criterion for finite metric spaces and minimal fillings

DOI10.3103/S0027132212020027zbMath1307.05099OpenAlexW1998737354MaRDI QIDQ355285

Olga V. Rubleva

Publication date: 24 July 2013

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132212020027

zbMATH Keywords

weighted graphweightconnected graph, metricpseudometric space

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Metric spaces, metrizability (54E35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance geometry (51K99) Distance in graphs (05C12) Connectivity (05C40) Signed and weighted graphs (05C22)

Related Items (2)

The functions that do not change types of minimal fillings ⋮ Minimal Networks: A Review

Cites Work

• Filling Riemannian manifolds
• One-dimensional Gromov minimal filling problem
• A note on the tree realizability of a distance matrix
• Encyclopedia of Distances

This page was built for publication: The additivity criterion for finite metric spaces and minimal fillings