Minimum spanning paths and Hausdorff distance in finite ultrametric spaces

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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the shortest spanning subtree of a graph and the traveling salesman problem
Some properties and applications of the Hausdorff distance
Trees, ultrametrics, and noncommutative geometry
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
On the Gomory-Hu inequality
On spaces extremal for the Gomory-Hu inequality
Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
Geometry of non-Archimedean Gromov-Hausdorff distance
Diameter and diametrical pairs of points in ultrametric spaces
Trees and ultrametric spaces: A categorical equivalence
The structures of Hausdorff metric in non-Archimedean spaces
Finite ultrametric balls
On some extremal properties of finite ultrametric spaces
From isomorphic rooted trees to isometric ultrametric spaces
How rigid the finite ultrametric spaces can be?
The category of ultrametric spaces is isomorphic to the category of complete, atomic, tree-like, and real graduated lattices LAT\(^*\)
The comb representation of compact ultrametric spaces
Sublinear time algorithms for metric space problems
An optimal minimum spanning tree algorithm
On Cartesian Trees and Range Minimum Queries
Multi-Terminal Network Flows
A randomized linear-time algorithm to find minimum spanning trees
Fibonacci heaps and their uses in improved network optimization algorithms
Algorithms and Computation
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

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