Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440)

From MaRDI portal
Revision as of 14:08, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
scientific article

    Statements

    Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (English)
    0 references
    14 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    distance
    0 references
    ultrametric
    0 references
    spanning tree
    0 references
    minimum cut
    0 references
    maximum flow
    0 references
    Gomory
    0 references
    Hu tree
    0 references
    widest bottleneck path
    0 references
    decomposing \(n\)-graphs
    0 references
    positional game
    0 references
    0 references
    0 references
    0 references