Maximal flow in branching trees and binary search trees (Q655924)
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: Maximal flow in branching trees and binary search trees |
scientific article; zbMATH DE number 6000270
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximal flow in branching trees and binary search trees |
scientific article; zbMATH DE number 6000270 |
Statements
Maximal flow in branching trees and binary search trees (English)
0 references
26 January 2012
0 references
branching trees
0 references
binary search trees
0 references
maximal flow in capacitated network
0 references
McKean trees
0 references
random capacities
0 references
0 references
0.87708443
0 references
0.8684201
0 references
0 references
0 references
0.8657368
0 references
0 references
0.86370265
0 references
