Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (Q5952050): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:06, 30 January 2024
scientific article; zbMATH DE number 1687624
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts |
scientific article; zbMATH DE number 1687624 |
Statements
Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (English)
0 references
8 January 2002
0 references
edge weighted undirected graph
0 references
approximation algorithm
0 references
