Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time (Q4939605)
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 1400081
| 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 1400081 |
Statements
Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time (English)
0 references
28 May 2000
0 references
Hao-Orlin minimum cut algorithm
0 references
0.9068220257759094
0 references
0.9024077653884888
0 references
0.878040611743927
0 references
