Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs |
scientific article; zbMATH DE number 6065736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs |
scientific article; zbMATH DE number 6065736 |
Statements
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (English)
0 references
14 August 2012
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.7496170997619629
0 references
0.7404059171676636
0 references
0.7404059171676636
0 references
0.7343271970748901
0 references
0.7330897450447083
0 references
