Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time (Q4939605)
From MaRDI portal
scientific article; zbMATH DE number 1400081
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
