An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts (Q3596719)
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 5500012
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts |
scientific article; zbMATH DE number 5500012 |
Statements
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts (English)
0 references
29 January 2009
0 references
\(k\)-way cut
0 references
divide-and-conquer
0 references
graph algorithm
0 references
0.9193429350852966
0 references
0.9179558157920836
0 references
0.8680249452590942
0 references
