The additivity criterion for finite metric spaces and minimal fillings

DOI10.3103/S0027132212020027zbMATH Open1307.05099OpenAlexW1998737354MaRDI QIDQ355285FDOQ355285

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

Recommendations

• Minimal fillings of finite metric spaces: The state of the art
• A formula for the weight of a minimal filling of a finite metric space
• One-dimensional minimal fillings with negative edge weights
• Gromov minimal fillings for finite metric spaces
• Steiner problem in the Gromov-Hausdorff space: the case of finite metric spaces

zbMATH Keywords

weightweighted graphconnected graph, metricpseudometric space

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Minimal Networks: A Review
• Polytops of Binary Trees, Structure of the Polytop for the «Snake-type»-Tree
• The functions that do not change types of minimal fillings
• A formula for the weight of a minimal filling of a finite metric space
• Sets admitting connection by graphs of finite length

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355285)