Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
DOI10.1016/J.DAM.2012.03.034zbMATH Open1245.05058OpenAlexW2078658343MaRDI QIDQ444440FDOQ444440
Authors: Vladimir Gurvich, Mikhail Vyalyi 
Publication date: 14 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.034
Recommendations
distancemaximum flowminimum cutultrametricspanning treedecomposing \(n\)-graphsGomoryHu treepositional gamewidest bottleneck path
Directed graphs (digraphs), tournaments (05C20) Metric spaces, metrizability (54E35) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Maximal Flow Through a Network
- Title not available (Why is that?)
- The directed subgraph homeomorphism problem
- On Cartesian Trees and Range Minimum Queries
- Counting Minimum Weight Spanning Trees
- Metric and ultrametric spaces of resistances
- Encyclopedia of Distances
- Multi-Terminal Network Flows
- Metric and ultrametric spaces of resistances
- On graphs whose maximal cliques and stable sets intersect
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Isometric embedding of ultrametric (non-Archimedean) spaces in Hilbert space and Lebesgue space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The category of ultrametric spaces is isomorphic to the category of complete, atomic, tree-like, and real graduated lattices LAT\(^*\)
- On a universal ultrametric space
- Trees as semilattices
- Proximity on equilateral spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counterexamples for Directed and Node Capacitated Cut-Trees
Cited In (24)
- Labeled trees generating complete, compact, and discrete ultrametric spaces
- Combinatorial properties of ultrametrics and generalized ultrametrics
- The range of ultrametrics, compactness, and separability
- Metric and ultrametric inequalities for directed graphs
- Resistance distance in connected balanced digraphs
- Weak similarities of finite ultrametric and semimetric spaces
- How rigid the finite ultrametric spaces can be?
- On some extremal properties of finite ultrametric spaces
- On the Gomory-Hu inequality
- On spaces extremal for the Gomory-Hu inequality
- Minimum spanning paths and Hausdorff distance in finite ultrametric spaces
- On optimal realizations of finite metric spaces by graphs
- On ultrametric-preserving functions
- Ultrametric preserving functions and weak similarities of ultrametric spaces
- Hereditary properties of finite ultrametric spaces
- On quasisymmetric mappings between ultrametric spaces
- Uniqueness of best proximity pairs and rigidity of semimetric spaces
- Bipartite graphs and best proximity pairs
- Finite ultrametric balls
- Ultragraphs and shift spaces over infinite alphabets
- On \(p\)-metric spaces and the \(p\)-Gromov-Hausdorff distance
- Quasi-ultrametrics and their \(2\)-ball hypergraphs
- From isomorphic rooted trees to isometric ultrametric spaces
- Properties and morphisms of finite ultrametric spaces and their representing trees
This page was built for publication: Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444440)
