CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK (Q5284939)
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: CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK |
scientific article; zbMATH DE number 969565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK |
scientific article; zbMATH DE number 969565 |
Statements
CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK (English)
0 references
22 January 1997
0 references
cactus representation
0 references
minimum cuts
0 references
edge-weighted, undirected network
0 references
maximum flow
0 references
0.9206404089927672
0 references
0.8785991668701172
0 references
0.878040611743927
0 references
0.8363227248191833
0 references
