Minimum spanning paths and Hausdorff distance in finite ultrametric spaces

DOI10.1134/S2070046622020054zbMATH Open1503.54017WikidataQ114074753 ScholiaQ114074753MaRDI QIDQ2152004FDOQ2152004

Publication date: 5 July 2022

Published in: \(p\)-Adic Numbers, Ultrametric Analysis, and Applications (Search for Journal in Brave)

Recommendations

Finite ultrametric balls
Some properties of finite ultrametric spaces
On some extremal properties of finite ultrametric spaces
Properties and morphisms of finite ultrametric spaces and their representing trees
Hereditary properties of finite ultrametric spaces
scientific article; zbMATH DE number 650878
scientific article; zbMATH DE number 1734592
From isomorphic rooted trees to isometric ultrametric spaces
Labeled trees generating complete, compact, and discrete ultrametric spaces
Mappings preserving balls of finite ultrametric spaces

zbMATH Keywords

Hausdorff distance minimum spanning tree finite ultrametric space representing tree injective internal labeling strictly \(n\)-ary tree

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62) Metric spaces, metrizability (54E35) Topological spaces with richer structures (54E99)

Cites Work

On the shortest spanning subtree of a graph and the traveling salesman problem
Graph theory
Introduction to algorithms.
Title not available (Why is that?)
A course in metric geometry
Fibonacci heaps and their uses in improved network optimization algorithms
On Cartesian Trees and Range Minimum Queries
Trees and ultrametric spaces: A categorical equivalence
Multi-Terminal Network Flows
A randomized linear-time algorithm to find minimum spanning trees
Sublinear time algorithms for metric space problems
Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
Trees, ultrametrics, and noncommutative geometry
Some properties and applications of the Hausdorff distance
An optimal minimum spanning tree algorithm
The category of ultrametric spaces is isomorphic to the category of complete, atomic, tree-like, and real graduated lattices LAT\(^*\)
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
Diameter and diametrical pairs of points in ultrametric spaces
On the Gomory-Hu inequality
On spaces extremal for the Gomory-Hu inequality
Title not available (Why is that?)
Geometry of non-Archimedean Gromov-Hausdorff distance
Title not available (Why is that?)
On some extremal properties of finite ultrametric spaces
Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
Finite ultrametric balls
From isomorphic rooted trees to isometric ultrametric spaces
How rigid the finite ultrametric spaces can be?
The comb representation of compact ultrametric spaces
Algorithms and Computation
The structures of Hausdorff metric in non-Archimedean spaces

Cited In (1)

Combinatorial optimization problems in ultrametric spaces

This page was built for publication: Minimum spanning paths and Hausdorff distance in finite ultrametric spaces

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