An $\NC$ Algorithm for Minimum Cuts (Q4337444)
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: An $\NC$ Algorithm for Minimum Cuts |
scientific article; zbMATH DE number 1011180
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $\NC$ Algorithm for Minimum Cuts |
scientific article; zbMATH DE number 1011180 |
Statements
An $\NC$ Algorithm for Minimum Cuts (English)
0 references
7 September 1997
0 references
minimum-cut problem
0 references
weighted undirected graphs
0 references
set-isolation problem
0 references
sparse \(k\)- connectivity certificate
0 references
0 references
0.92154545
0 references
0.9106399
0 references
0.90973115
0 references
0 references
0.90511817
0 references
0 references
