A simple algorithm for the planar multiway cut problem (Q2731602)
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: A simple algorithm for the planar multiway cut problem |
scientific article; zbMATH DE number 1626168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple algorithm for the planar multiway cut problem |
scientific article; zbMATH DE number 1626168 |
Statements
12 December 2001
0 references
min-cut problem
0 references
\(k\)-way cut
0 references
A simple algorithm for the planar multiway cut problem (English)
0 references
0.8515025973320007
0 references
0.8447450399398804
0 references
0.8394160866737366
0 references
0.8211610913276672
0 references
