Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time (Q3840367)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1187160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time |
scientific article; zbMATH DE number 1187160 |
Statements
10 August 1998
0 references
cactus tree
0 references
minimum cuts
0 references
weighted graph
0 references
0.978647768497467
0 references
0.9058236479759216
0 references
0.903920352458954
0 references
0.874915599822998
0 references
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time (English)
0 references
